Scheduling by positional completion times: Analysis of a two-stage flow shop problem with a batching machine

DOI10.1007/BF01585876zbMath0922.90086MaRDI QIDQ1290647

Steef L. van de Velde, Hoogeveen, J. A.

Publication date: 18 October 1999

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

Lagrangian relaxationbatchingtotal completion timemathematical formulationflow shop schedulingpositional completion timesmachine scheduling problems

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

A two-stage flow-shop scheduling problem with incompatible job families and limited waiting time ⋮ Lower bounds for minimizing total completion time in a two-machine flow shop ⋮ Scheduling with batching: A review ⋮ A branch and bound algorithm for a production scheduling problem in an assembly system under due date constraints

Cites Work

• Minimizing Total Completion Time in a Two-Machine Flowshop: Analysis of Special Cases
• Batching and Scheduling Jobs on Batch and Discrete Processors
• New Lower and Upper Bounds for Scheduling Around a Small Common Due Date