Time lag size in multiple operations flow shop scheduling heuristics

DOI10.1016/S0377-2217(97)00025-8zbMATH Open0957.90055OpenAlexW2157105402MaRDI QIDQ1291707FDOQ1291707

Gerard J. C. Gaalman, Jan Riezebos

Publication date: 22 March 2001

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(97)00025-8

Recommendations

• Shop Problems With Two Machines and Time Lags
• Permutation flowshop scheduling problems with maximal and minimal time lags
• Minimizing the makespan in a 2-machine flowshop with time lags and setup conditions
• Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic
• The permutation flowshop scheduling problem with exact time lags to minimise the total earliness and tardiness

zbMATH Keywords

heuristicslower boundsflow shop schedulingtime lagsmultiple operations

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)

Cites Work

• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Optimal two- and three-stage production schedules with set-up time included
• The one-machine sequencing problem
• Shop Problems With Two Machines and Time Lags
• Sequencing \(n\) jobs on two machines with arbitrary time lags
• Scheduling coupled tasks
• V-shop scheduling
• Flow Shop Problems with Time Lags

Cited In (3)

• A memetic algorithm for the job-shop with time-lags
• Improved formulations and new valid inequalities for a hybrid flow shop problem with time-varying resources and chaining time-lag
• Performance analysis of active schedules in identical parallel machine

This page was built for publication: Time lag size in multiple operations flow shop scheduling heuristics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1291707)