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

DOI10.1016/S0377-2217(99)00031-4MaRDI QIDQ1969905zbMATH OpenOpenAlexFDO

Authors Chang Sup Sung, Young Hwan Kim, Sang Hum Yoon

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

batch processing machineflowshopscheduling

Mathematics Subject Classification ID

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

Recommendations

• Flowshop scheduling problem with a batching machine and task compatibilities
• Scheduling a proportionate flow shop of batching machines
• Scheduling a proportionate flow shop of batching machines
• Batching and scheduling in a multi-machine flow shop
• An approximation algorithm for scheduling batch processing machines with non-identical job sizes in flow shop
• Decomposition approaches in permutation scheduling problems with application to the M-machine flow shop scheduling problems
• Scheduling hybrid flowshop with parallel batching machines and compatibilities
• A SHIFTING BOTTLENECK APPROACH FOR A PARALLEL-MACHINE FLOWSHOP SCHEDULING PROBLEM
• A hybrid scheduling approach for a two-stage flexible flow shop with batch processing machines
• A note on batch scheduling on a two-machine flowshop with machine-dependent processing times

Cites work

• Batching and Scheduling Jobs on Batch and Discrete Processors
• Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
• Efficient scheduling algorithms for a single batch processing machine
• Minimizing total completion time on a batch processing machine with job families
• Scheduling a single batch processing machine with non-identical job sizes
• Scheduling Groups of Jobs on a Single Machine
• Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime
• Scheduling with agreeable release times and due dates on a batch processing machine

Cited in

(18)

• 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
• Two-stage hybrid flow shop scheduling with dynamic job arrivals
• Integrated problem of soaking pit heating and hot rolling scheduling in steel plants
• A survey of scheduling with parallel batch (p-batch) processing
• Online algorithms to schedule a proportionate flexible flow shop of batching machines
• MIP formulations and heuristics for solving parallel batching problems
• Capacitated lot sizing and scheduling with parallel machines and shared buffers: A case study in a packaging company
• Mixed integer formulation to minimize makespan in a flow shop with batch processing machines
• Arc-flow approach for single batch-processing machine scheduling
• Two-stage flowshop scheduling problems with identical and batch processors
• A HYBRID TWO-STAGE FLOWSHOP SCHEDULING PROBLEM
• Scheduling a proportionate flow shop of batching machines
• Scheduling a proportionate flow shop of batching machines
• Minimizing makespan in a two-machine flowshop with dynamic arrivals allowed
• Novel mathematical formulations for parallel-batching processing machine scheduling problems
• Minimizing makespan with multiple-orders-per-job in a two-machine flowshop
• The coordination of transportation and batching scheduling

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

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