A note on a greedy heuristic for flow-shop makespan minimization with no machine idle-time

DOI10.1016/J.EJOR.2006.11.025MaRDI QIDQ2384652zbMATH OpenOpenAlexFDO

Authors Daniel Baraz, Gur Mosheiov

Publication date 10 October 2007

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

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

zbMATH Keywords

heuristicsmakespanflowshopScheduling

Mathematics Subject Classification ID

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

Recommendations

• Minimizing the Number of Machine Idle Intervals with Minimum Makespan in a Flow-Shop
• A New Heuristic for Three-Machine Flow Shop Scheduling
• A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan
• Heuristic for no-wait flow shops with makespan minimization based on total idle-time increments
• The flow shop problem with no-idle constraints: a review and approximation

Cites work

• scientific article; zbMATH DE number 782644 (Why is no real title available?)
• A travelling salesman approach to solve the \(F\)/no-idle/\(C_{max}\) problem

Cited in

(15)

• An iterated greedy algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times
• Minimization of maximum lateness on parallel machines with sequence-dependent setup times and job release dates
• A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion
• A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion
• A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem
• A branch-and-bound approach to the no-idle flowshop scheduling problem
• A hybrid discrete teaching-learning based meta-heuristic for solving no-idle flow shop scheduling problem with total tardiness criterion
• Minimizing the Number of Machine Idle Intervals with Minimum Makespan in a Flow-Shop
• A new iterated greedy algorithm for no-idle permutation flowshop scheduling with the total tardiness criterion
• On no-wait and no-idle flow shops with makespan criterion
• The flow shop problem with no-idle constraints: a review and approximation
• A systematic literature review on no-idle flow shop scheduling problem
• Beam search-based heuristics for the mixed no-idle flowshop with total flowtime criterion
• MILP-based local search procedures for minimizing total tardiness in the no-idle permutation flowshop problem
• Metaheuristics with restart and learning mechanisms for the no-idle flowshop scheduling problem with makespan criterion

Describes a project that uses

Uses Software

• LINDO
• LINGO

This page was built for publication: A note on a greedy heuristic for flow-shop makespan minimization with no machine idle-time

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