The flow shop problem with no-idle constraints: a review and approximation

DOI10.1016/j.ejor.2008.03.039zbMath1163.90711OpenAlexW2084159885MaRDI QIDQ1027525

Yaroslav Goncharov, Sergey Sevast'janov

Publication date: 30 June 2009

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2008.03.039

zbMATH Keywords

schedulingcombinatorial optimizationapproximation algorithmflow shop

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items

Two-stage hybrid flowshop scheduling with simultaneous processing machines ⋮ Minimizing Total Idle Energy Consumption in the Permutation Flow Shop Scheduling Problem ⋮ Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling ⋮ Metaheuristics with restart and learning mechanisms for the no-idle flowshop scheduling problem with makespan criterion ⋮ MILP-based local search procedures for minimizing total tardiness in the no-idle permutation flowshop problem ⋮ Benders decomposition for the mixed no-idle permutation flowshop scheduling problem ⋮ A branch-and-bound approach to the no-idle flowshop scheduling problem ⋮ A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion ⋮ Analysis of flow shop scheduling anomalies ⋮ A new iterated greedy algorithm for no-idle permutation flowshop scheduling with the total tardiness criterion ⋮ Permutation, no-wait, no-idle flow shop problems ⋮ Three-stage ordered flow shops with either synchronous flow, blocking or no-idle machines ⋮ No-idle, no-wait: when shop scheduling meets dominoes, Eulerian paths and Hamiltonian paths

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nonstrict vector summation in multi-operation scheduling
• On some geometric methods in scheduling theory: A survey
• A travelling salesman approach to solve the \(F\)/no-idle/\(C_{max}\) problem
• Two-Machine No-Wait Flow Shop Scheduling with Missing Operations
• Optimal two- and three-stage production schedules with setup times included
• The Complexity of Flowshop and Jobshop Scheduling
• Minimizing the Number of Machine Idle Intervals with Minimum Makespan in a Flow-Shop
• Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times
• Vector Summation in Banach Space and Polynomial Algorithms for Flow Shops and Open Shops
• Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem

This page was built for publication: The flow shop problem with no-idle constraints: a review and approximation