Minimizing makespan in a two-machine flowshop with dynamic arrivals allowed

DOI10.1016/S0305-0548(00)00071-XzbMath0993.90051OpenAlexW2008200945MaRDI QIDQ5952788

Chang Sup Sung, Young Hwan Kim

Publication date: 20 May 2002

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(00)00071-x

zbMATH Keywords

heuristic algorithmworst-case errorscheduling problemtwo-machine flowshop

Mathematics Subject Classification ID

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

Related Items (13)

A hybrid two-stage transportation and batch scheduling problem ⋮ Two-machine flowshop scheduling problems involving a batching machine with transportation or deterioration consideration ⋮ Minimizing makespan in a two-machine flowshop scheduling with batching and release time ⋮ A Two-Stage Flexible Flowshop Problem with Deterioration ⋮ Realistic two-stage flowshop batch scheduling problems with transportation capacity and times ⋮ On-line integrated production and outbound distribution scheduling to minimize the maximum delivery completion time ⋮ A hybrid scheduling approach for a two-stage flexible flow shop with batch processing machines ⋮ Minimizing makespan for multi-spindle head machines with a mobile table ⋮ The coordination of transportation and batching scheduling ⋮ Two-stage hybrid flow shop scheduling with dynamic job arrivals ⋮ A TWO-STAGE FLOWSHOP SCHEDULING WITH LIMITED BUFFER STORAGE ⋮ A survey of scheduling with parallel batch (p-batch) processing ⋮ A two-stage flow shop scheduling problem on a batching machine and a discrete machine with blocking and shared setup times

Uses Software

• CPLEX

Cites Work

• Efficient scheduling algorithms for a single batch processing machine
• Scheduling with agreeable release times and due dates on a batch processing machine
• Minimizing makespan on a single burn-in oven in semiconductor manufacturing
• A problem reduction and decomposition approach for scheduling for a flowshop of batch processing machines
• Minimizing total completion time on a batch processing machine with job families
• Batching and Scheduling Jobs on Batch and Discrete Processors
• Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
• Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime
• Scheduling a single batch processing machine with non-identical job sizes
• Scheduling batch processing machines with incompatible job families
• Scheduling Groups of Jobs on a Single Machine
• Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline
• Scheduling in a two-machine flowshop with batch processing machine(s) for earliness/tardiness measure under a common due date

This page was built for publication: Minimizing makespan in a two-machine flowshop with dynamic arrivals allowed