A review of exact solution methods for the non-preemptive multiprocessor flowshop problem

DOI10.1016/j.ejor.2003.12.026zbMath1057.90015OpenAlexW1974441729MaRDI QIDQ1767678

Tamás Kis, Erwin Pesch

Publication date: 8 March 2005

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

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

zbMATH Keywords

Branch and boundLower boundsConstraint propagationMultiprocessor flowshop

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

An efficient heuristic method for joint optimization of train scheduling and stop planning on double-track railway systems, Hybrid flexible flowshop problems: models and solution methods, Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective, Practical solutions for a dock assignment problem with trailer transportation, Optimal scheduling of a two-stage hybrid flow shop, A taxonomy of flexible flow line scheduling procedures, Mixed binary integer programming formulations for the flow shop scheduling problems. A case study: ISD projects scheduling, Energy aware scheduling in flexible flow shops with hybrid particle swarm optimization, Scheduling open shops with parallel machines to minimize total completion time, Constraint programming for multi-line parallel partial disassembly line balancing problem with optional common stations, A systematic review of multi-objective hybrid flow shop scheduling, Control methods for dynamic time-based manufacturing under customized product lead times, Flexible job shop scheduling with blockages, A memetic algorithm for the flexible flow line scheduling problem with processor blocking, A discrete time exact solution approach for a complex hybrid flow-shop scheduling problem with limited-wait constraints, Two-stage hybrid flow shop scheduling with dynamic job arrivals, Bounding strategies for the hybrid flow shop scheduling problem, The hybrid flow shop scheduling problem, Metaheuristic algorithms for the hybrid flowshop scheduling problem, A multi‐objective customer orders assignment and resource leveling in make‐to‐order manufacturing, Capacity-filtering algorithms for finite-capacity planning of a flexible flow line, Multi-objective master production scheduling in make-to-order manufacturing, Shifting representation search for hybrid flexible flowline problems, Algorithms for a realistic variant of flowshop scheduling, Machine scheduling in production: a content analysis, Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint, Optimal solutions for a dock assignment problem with trailer transportation, Conceptual framework for lot-sizing and scheduling of flexible flow lines, The evolution of schematic representations of flow shop scheduling problems, A heuristic for scheduling in a two-stage hybrid flowshop with renewable resources shared among the stages

Cites Work

• Unnamed Item
• Unnamed Item
• Scheduling algorithms for flexible flowshops: Worst and average case performance
• Branch and bound algorithm for the flow shop with multiple processors
• Scheduling jobs with release dates and tails on identical machines to minimize the makespan
• Global lower bounds for flow shops with multiple processors
• A multi-stage parallel-processor flowshop problem with minimum flowtime
• Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard
• The job shop scheduling problem: Conventional and new solution techniques
• Jackson's pseudo preemptive schedule for the \(Pm/r_i, q_i/C_{\text{max}}\) scheduling problem
• Branch and bound crossed with GA to solve hybrid flowshops
• Minimizing makespan in hybrid flowshops
• Optimal two- and three-stage production schedules with setup times included
• Lower Bounds for the Head-Body-Tail Problem on Parallel Machines: A Computational Study of the Multiprocessor Flow Shop
• Two-Stage, Hybrid Flowshop Scheduling Problem
• Two-Processor Scheduling with Start-Times and Deadlines
• The Complexity of Flowshop and Jobshop Scheduling
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• A computational study of heuristics for two-stage flexible flowshops
• Les problèmes d'ordonnancement de type flow-shop hybride : état de l'art
• An Exact Method for Solving the Multi-Processor Flow-Shop
• Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline
• A flexible flowshop problem with total flow time minimization