New heuristics for No-wait Flowshop Scheduling with Precedence Constraints and Sequence Dependent Setup Time
- Title
- New heuristics for No-wait Flowshop Scheduling with Precedence Constraints and Sequence Dependent Setup Time
- Author
- 이영해
- Keywords
- Schedule Problem; Percentage Error; Heuristic Algorithm; Travel Salesman Problem; Travel Salesman Problem
- Issue Date
- 2005-05
- Publisher
- SPRINGER-VERLAG BERLIN
- Citation
- International Conference on Computational Science and Its Applications; Computational Science and Its Applications – ICCSA 2005, Page. 467-476
- Abstract
- This paper addresses a method to obtain the best sequence for no-wait flowshop scheduling with precedence constraints and sequence dependent setup time. The system is made up of a set of machines of various types and there is no interruption between tasks in a job. The objective is to determine the job sequence for processing with minimum makespan. The sequencing problem with precedence constraints and sequence dependent setup times is equivalent to the traveling salesman problem. A mixed integer programming (MIP) model is presented to obtain the best schedule. It is known that the MIP model for no-wait flowshop scheduling is NP-hard. Heuristic algorithms to gain the best job sequence are developed. From the experiments, it is found that the proposed algorithm generates the best job sequence efficiently.
- URI
- https://link.springer.com/chapter/10.1007/11424925_50https://repository.hanyang.ac.kr/handle/20.500.11754/110625
- ISBN
- 978-3-540-25863-6
- DOI
- 10.1007/11424925_50
- Appears in Collections:
- COLLEGE OF ENGINEERING SCIENCES[E](공학대학) > INDUSTRIAL AND MANAGEMENT ENGINEERING(산업경영공학과) > Articles
- Files in This Item:
There are no files associated with this item.
- Export
- RIS (EndNote)
- XLS (Excel)
- XML