Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling

DOI10.1016/S0377-2217(02)00245-XzbMath1037.90035MaRDI QIDQ1869668

Kazuko Morizawa, Hiroyuki Nagasawa, Xi Sun

Publication date: 28 April 2003

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

zbMATH Keywords

parallel machinesHeuristicsflowshop schedulingMakespan

Mathematics Subject Classification ID

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

Related Items

Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures ⋮ The 2-stage assembly flowshop scheduling problem with total completion time: efficient constructive heuristic and metaheuristic ⋮ Cloud theory-based simulated annealing approach for scheduling in the two-stage assembly flowshop ⋮ A self-adaptive differential evolution heuristic for two-stage assembly scheduling problem to minimize maximum lateness with setup times ⋮ A note on the two-stage assembly flow shop scheduling problem with uniform parallel machines ⋮ Assembly flowshop scheduling problem: speed-up procedure and computational evaluation ⋮ A biased‐randomized iterated local search for the distributed assembly permutation flow‐shop problem ⋮ Lot streaming for a two-stage assembly system in the presence of handling costs ⋮ Minimizing the makespan for a two-stage three-machine assembly flow shop problem with the sum-of-processing-time based learning effect ⋮ A branch and bound algorithm for hybrid flow shop scheduling problem with setup time and assembly operations ⋮ On the optimality conditions of the two-machine flow shop problem ⋮ A scheduling problem to minimize total weighted tardiness in the two-stage assembly flowshop ⋮ A two-stage assembly-type flowshop scheduling problem for minimizing total tardiness ⋮ Multi-objective optimisation in flexible assembly job shop scheduling using a distributed ant colony system ⋮ Two-stage assembly scheduling problem for minimizing total tardiness with setup times ⋮ Heuristics for a two-stage assembly flowshop with bicriteria of maximum lateness and makespan ⋮ Genetic algorithms and simulated annealing for scheduling in agile manufacturing ⋮ The two-stage assembly scheduling problem to minimize total completion time with setup times ⋮ A PSO and a tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application ⋮ Evolutionary heuristics and an algorithm for the two-stage assembly scheduling problem to minimize makespan with setup times ⋮ A HYBRID TWO-STAGE FLOWSHOP SCHEDULING PROBLEM

Cites Work

• Scheduling algorithms for flexible flowshops: Worst and average case performance
• Branch and bound algorithm for the flow shop with multiple processors
• Global lower bounds for flow shops with multiple processors
• A branch and bound algorithm for the two-stage assembly scheduling problem
• Optimal two- and three-stage production schedules with setup times included
• Two-Stage, Hybrid Flowshop Scheduling Problem
• Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem
• FLOWMULT: Permutation Sequences for Flow Shops with Multiple Processors
• Analysis of Classes of Heuristics for Scheduling a Two-Stage Flow Shop with Parallel Machines at One Stage
• The Two-Stage Assembly Scheduling Problem: Complexity and Approximation
• Unnamed Item