An efficient heuristic based on machine workload for the flowshop scheduling problem with setup and removal
From MaRDI portal
Publication:1339130
DOI10.1007/BF02085643zbMath0815.90090MaRDI QIDQ1339130
Publication date: 1 December 1994
Published in: Annals of Operations Research (Search for Journal in Brave)
makespanheuristicbottleneck machines\(n\) jobs, \(M\) machines flowshop schedulingsetup, processing and removal times
Related Items
Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines ⋮ A simultaneous and iterative approach for parallel machine scheduling with sequence-dependent family setups
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A practical use of Jackson's preemptive schedule for solving the job shop problem
- The two-machine sequence dependent flowshop scheduling problem
- Optimal two- and three-stage production schedules with setup times included
- FLOWSHOP SCHEDULES WITH SEQUENCE DEPENDENT SETUP TIMES
- A survey and evaluation of static flowshop scheduling heuristics
- Flow Shop Problems with Time Lags
- A MILP model for then-job,M-stage flowshop with sequence dependent set-up times
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- An Algorithm for Solving the Job-Shop Problem
- Two machine flow shop scheduling problems with sequence dependent setup times: A dynamic programming approach
- An Evaluation of Flow Shop Sequencing Heuristics
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Sequencing n jobs on two machines with setup, processing and removal times separated
- Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
