Flowshop/no-idle scheduling to minimize total elapsed time

DOI10.1007/S10898-004-1848-YzbMath1093.90018OpenAlexW2027090910MaRDI QIDQ811886

P. C. Bagga, Laxmi Narain

Publication date: 23 January 2006

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-004-1848-y

zbMATH Keywords

OptimizationCompletion timeSequencing theoryTotal elapsed time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (6)

A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem ⋮ iGreen: green scheduling for peak demand minimization ⋮ No-idle parallel-machine scheduling of unit-time jobs with a small number of distinct release dates and deadlines ⋮ Metaheuristics with restart and learning mechanisms for the no-idle flowshop scheduling problem with makespan criterion ⋮ New heuristics for total tardiness minimization in a flexible flowshop ⋮ A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion

Cites Work

• Optimal two- and three-stage production schedules with setup times included
• An improved branch and bound procedure forn ×m flow shop problems
• Special cases of the flow-shop problem
• Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times
• A General Algorithm for Solution of the n-Job, M-Machine Sequencing Problem of the Flow Shop
• Development of M-Stage Decision Rule for Scheduling N Jobs Through M Machines

This page was built for publication: Flowshop/no-idle scheduling to minimize total elapsed time