Two-machine flowshop batching and scheduling

DOI10.1007/s10479-004-5029-7zbMath1119.90019OpenAlexW2082018377MaRDI QIDQ1772969

Bertrand M. T. Lin, Cheng, T. C. Edwin

Publication date: 22 April 2005

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10397/1141

zbMATH Keywords

heuristicsproduction schedulingmakespanlower boundflowshopstrong NP-hardnessbatch processing

Mathematics Subject Classification ID

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

Related Items

Optimal single machine scheduling of products with components and changeover cost, Minimizing makespan in a two-machine flowshop scheduling with batching and release time, Scheduling a hybrid flowshop with batch production at the last stage, A bicriteria two-machine flow-shop serial-batching scheduling problem with bounded batch size, Scheduling for fabrication and assembly in a two-machine flowshop with a fixed job sequence, A survey of scheduling problems with setup times or costs, Fabrication scheduling on a single machine with due date constraints, A two-stage flow shop scheduling problem on a batching machine and a discrete machine with blocking and shared setup times

Cites Work

• Unnamed Item
• Unnamed Item
• One-pass batching algorithms for the one-machine problem
• The complexity of one-machine batching problems
• Scheduling with batching: A review
• Optimal two- and three-stage production schedules with setup times included
• Scheduling Batches with Sequential Job Processing for Two-Machine Flow and Open Shops
• Optimal Scheduling of Products with Two Subassemblies on a Single Machine
• Batching and Scheduling Jobs on Batch and Discrete Processors
• Single Machine Scheduling to Minimize Batch Delivery and Job Earliness Penalties