摘要
This study addresses a variant of job-shop scheduling in which jobs are grouped into job families, but they are processed individually. The problem can be found in various industrial systems, especially in reprocessing shops of remanufacturing systems. If the reprocessing shop is a job-shop type and has the component-matching requirements, it can be regarded as a job shop with job families since the components of a product constitute a job family. In particular, sequence-dependent set-ups in which set-up time depends on the job just completed and the next job to be processed are also considered. The objective is to minimize the total family flow time, i.e. the maximum among the completion times of the jobs within a job family. A mixed-integer programming model is developed and two iterated greedy algorithms with different local search methods are proposed. Computational experiments were conducted on modified benchmark instances and the results are reported.
学科与关键词
- Solution algorithms to minimise the total family tardiness for job shop scheduling with job familiesYu, Jae-Min; Lee, Dong-Ho*European Journal of Industrial Engineering, 2018, 12(1): 1-23.被引 5
- A review on job shop scheduling with setup timesSharma, Pankaj*; Jain, AjaiPROCEEDINGS OF THE INSTITUTION OF MECHANICAL ENGINEERS PART B-JOURNAL OF ENGINEERING MANUFACTURE, 2016, 230(3): 517-533.被引 30
- Heuristics and iterated greedy algorithms for the distributed mixed no-idle flowshop with sequence-dependent setup timesRossi, Fernando Luis*; Nagano, Marcelo SeidoCOMPUTERS & INDUSTRIAL ENGINEERING, 2021, 157: 107337.被引 26
