Time lag size in multiple operations flow shop scheduling heuristics

DOI10.1016/S0377-2217(97)00025-8zbMath0957.90055OpenAlexW2157105402MaRDI QIDQ1291707

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

zbMATH Keywords

heuristicslower boundsflow shop schedulingtime lagsmultiple operations

Mathematics Subject Classification ID

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

Related Items (3)

Performance analysis of active schedules in identical parallel machine ⋮ 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

Cites Work

• V-shop scheduling
• The one-machine sequencing problem
• Sequencing n Jobs on Two Machines with Arbitrary Time Lags
• Optimal two- and three-stage production schedules with setup times included
• Flow Shop Problems with Time Lags
• Scheduling coupled tasks
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Shop Problems With Two Machines and Time Lags

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