Scheduling batches with sequential job processing for two-machine flow and open shops

DOI10.1287/IJOC.13.2.120.10521MaRDI QIDQ2884499zbMATH OpenOpenAlexFDO

Authors Chris N. Potts, C. A. Glass, V. A. Strusevich

Publication date 30 May 2012

Published in INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/ijoc.13.2.120.10521

zbMATH Keywords

computational complexitysuboptimal algorithmsproduction-schedulingopen-shop flow-shop

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Recommendations

• Open-shop batch scheduling with identical jobs
• Scheduling batches with simultaneous job processing for two-machine shop problems
• Two-machine flowshop batching and scheduling
• scientific article; zbMATH DE number 1437089
• Approximation algorithms for two-machine flow shop scheduling with batch setup times

Cited in

(26)

• Scheduling incompatible tasks on two machines
• Three is easy, two is hard: Open shop sum-batch scheduling problem refined
• A bicriteria two-machine flow-shop serial-batching scheduling problem with bounded batch size
• Scheduling with batching: A review
• Batching and scheduling in a multi-machine flow shop
• Transporting jobs through a two‐machine open shop
• AN IMPROVED APPROXIMATION ALGORITHM FOR THE TWO-MACHINE FLOW SHOP SCHEDULING PROBLEM WITH AN INTERSTAGE TRANSPORTER
• Solving the serial batching problem in job shop manufacturing systems
• Batch scheduling on a two-machine jobshop with machine-dependent setup times
• Total completion time minimization in two-machine flow shop scheduling problems with a fixed job sequence
• Complexity of flow shop scheduling problems with transportation constraints
• A bicriteria flow-shop scheduling problem with two serial batching machines
• Model approximation for batch flow shop scheduling with fixed batch sizes
• Batch scheduling on two-machine flowshop with machine-dependent setup times
• Scheduling batches with simultaneous job processing for two-machine shop problems
• Two-machine flowshop batching and scheduling
• Four decades of research on the open-shop scheduling problem to minimize the makespan
• No-wait scheduling problems with batching machines
• A survey of scheduling problems with setup times or costs
• Open-shop batch scheduling with identical jobs
• Scheduling with centralized and decentralized batching policies in concurrent open shops
• Two-agent scheduling with agent specific batches on an unbounded serial batching machine
• Two-machine shop scheduling: Compromise between flexibility and makespan value
• Batching decisions for assembly production systems
• Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
• Flow shop and open shop scheduling with a critical machine and two operations per job

This page was built for publication: Scheduling batches with sequential job processing for two-machine flow and open shops

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