The Local Search and Experiments of Job-Shop Scheduling Problem

Ning Zhao () and Si-yu Chen
Additional contact information
Ning Zhao: University of Science and Technology Beijing
Si-yu Chen: University of Science and Technology Beijing

Chapter Chapter 10 in Proceedings of 2012 3rd International Asia Conference on Industrial Engineering and Management Innovation (IEMI2012), 2013, pp 89-95 from Springer

Abstract: Abstract The Job-shop Scheduling Problem is a typical scheduling problem, which is regarded as NP-hard because of its complexity. Improvement based on traditional local search methods is realized with the combination of neighborhood and critical path. Firstly, feasible solution is achieved by heuristic approaches or just randomization. Secondly, makespan optimized solution is achieved by improved local search. Finally, the improved local search method is proved effectively by experiments, moreover the searching process is visible and suits man–machine interaction.

Keywords: Local search; Job-shop scheduling problem; Man–machine interaction; Critical path (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-33012-4_10

Ordering information: This item can be ordered from
http://www.springer.com/9783642330124

DOI: 10.1007/978-3-642-33012-4_10

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().