Scheduling job shops with batch machines using the Lagrangian relaxation technique
From MaRDI portal
Publication:1383473
DOI10.1016/S0947-3580(97)70085-2zbMath0895.90122MaRDI QIDQ1383473
Publication date: 28 September 1998
Published in: European Journal of Control (Search for Journal in Brave)
Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Production models (90B30) Dynamic programming (90C39)
Related Items (3)
Fuzzy cleaner production in assembly flexible job-shop scheduling with machine breakdown and batch transportation: Lagrangian relaxation ⋮ A simulation-based study of dispatching rules in a dynamic job shop scheduling problem with batch release and extended technical precedence constraints ⋮ A survey of scheduling with parallel batch (p-batch) processing
Cites Work
- Unnamed Item
- Unnamed Item
- Surrogate gradient algorithm for Lagrangian relaxation
- Batching and Scheduling Jobs on Batch and Discrete Processors
- Scheduling multi-purpose batch plants with junction constraints
- Scheduling batch processing machines with incompatible job families
- Scheduling Groups of Jobs on a Single Machine
This page was built for publication: Scheduling job shops with batch machines using the Lagrangian relaxation technique