A problem reduction and decomposition approach for scheduling for a flowshop of batch processing machines

DOI10.1016/S0377-2217(99)00031-4zbMath0953.90030OpenAlexW2011912841MaRDI QIDQ1969905

Young Hwan Kim, Sang Hum Yoon, Chang Sup Sung

Publication date: 19 July 2000

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

Full work available at URL: https://doi.org/10.1016/s0377-2217(99)00031-4

zbMATH Keywords

schedulingflowshopbatch processing machine

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Decomposition methods (49M27)

Related Items (15)

Minimizing makespan with multiple-orders-per-job in a two-machine flowshop ⋮ MIP formulations and heuristics for solving parallel batching problems ⋮ A hybrid scheduling approach for a two-stage flexible flow shop with batch processing machines ⋮ Family scheduling with batch availability in flow shops to minimize makespan ⋮ Capacitated lot sizing and scheduling with parallel machines and shared buffers: A case study in a packaging company ⋮ Integrated problem of soaking pit heating and hot rolling scheduling in steel plants ⋮ The coordination of transportation and batching scheduling ⋮ Two-stage hybrid flow shop scheduling with dynamic job arrivals ⋮ Mixed integer formulation to minimize makespan in a flow shop with batch processing machines ⋮ Minimizing makespan in a two-machine flowshop with dynamic arrivals allowed ⋮ TWO-STAGE FLOWSHOP SCHEDULING PROBLEMS WITH IDENTICAL AND BATCH PROCESSORS ⋮ Scheduling a proportionate flow shop of batching machines ⋮ A survey of scheduling with parallel batch (p-batch) processing ⋮ Online algorithms to schedule a proportionate flexible flow shop of batching machines ⋮ A HYBRID TWO-STAGE FLOWSHOP SCHEDULING PROBLEM

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 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 Groups of Jobs on a Single Machine

This page was built for publication: A problem reduction and decomposition approach for scheduling for a flowshop of batch processing machines