Iterated greedy algorithms to minimize the total family flow time for job-shop scheduling with job families and sequence-dependent set-ups-Reference-Cited by-同舟云学术

Iterated greedy algorithms to minimize the total family flow time for job-shop scheduling with job families and sequence-dependent set-ups

Published:2016-12-09 Issue:10 Volume:49 Page:1719-1732
ISSN:0305-215X
Container-title:Engineering Optimization
language:en
Short-container-title:Engineering Optimization

Author:

Kim Ji-Su¹,Park Jung-Hyeon²,Lee Dong-Ho³

Affiliation:

1. Department of Mechanical & Industrial Engineering, University of Toronto, Toronto, Canada

2. Domestic Sales System Team, Hyundai Autoever, Seoul, Republic of Korea

3. Department of Industrial Engineering, Hanyang University, Seoul, Republic of Korea

Publisher

Informa UK Limited

Subject

Applied Mathematics,Industrial and Manufacturing Engineering,Management Science and Operations Research,Control and Optimization,Computer Science Applications

Link

https://www.tandfonline.com/doi/pdf/10.1080/0305215X.2016.1261247

Reference42 articles.

1. A survey of scheduling problems with setup times or costs

2. A New Exact Solution Algorithm for the Job Shop Problem with Sequence-Dependent Setup Times

3. A branch and bound method for the job-shop problem with sequence-dependent setup times

4. Schedule Generation Schemes for the Job-Shop Problem with Sequence-Dependent Setup Times: Dominance Properties and Computational Analysis

5. A Petri net model and a general method for on and off-line multi-resource shop floor scheduling with setup times

Cited by 19 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Q-Learning Based Hybrid Meta-Heuristic for Integrated Scheduling of Disassembly and Reprocessing Processes Considering Product Structures and Stochasticity;Complex System Modeling and Simulation;2024-06

2. Integrated remanufacturing scheduling of disassembly, reprocessing and reassembly considering energy efficiency and stochasticity through group teaching optimization and simulation approaches;Engineering Optimization;2024-01-04

3. Heuristics to optimize total completion time subject to makespan in no-wait flow shops with sequence-dependent setup times;Journal of the Operational Research Society;2022-02-27

4. Introducing preferences in scheduling applications;Computers & Industrial Engineering;2022-01

5. Modeling and scheduling for remanufacturing systems with disassembly, reprocessing, and reassembly considering total energy consumption;Environmental Science and Pollution Research;2021-11-12