Scheduling job shops with batch machines using the Lagrangian relaxation technique
From MaRDI portal
(Redirected from Publication:1383473)
Recommendations
- Scheduling a hybrid flowshop with batch production at the last stage
- Scheduling batch processing in flexible flowshop with job dependent buffer requirements: Lagrangian relaxation approach
- An alternative framework to Lagrangian relaxation approach for job shop scheduling.
- Scheduling permutation flow shops using the Lagrangian relaxation technique
- scientific article; zbMATH DE number 1301847
Cites work
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 3619635 (Why is no real title available?)
- Batching and Scheduling Jobs on Batch and Discrete Processors
- Scheduling Groups of Jobs on a Single Machine
- Scheduling batch processing machines with incompatible job families
- Scheduling multi-purpose batch plants with junction constraints
- Surrogate gradient algorithm for Lagrangian relaxation
Cited in
(7)- A simulation-based study of dispatching rules in a dynamic job shop scheduling problem with batch release and extended technical precedence constraints
- Extending the single machine-based relaxation scheme for the job shop scheduling problem
- Scheduling batch processing in flexible flowshop with job dependent buffer requirements: Lagrangian relaxation approach
- Scheduling a hybrid flowshop with batch production at the last stage
- Fuzzy cleaner production in assembly flexible job-shop scheduling with machine breakdown and batch transportation: Lagrangian relaxation
- A survey of scheduling with parallel batch (p-batch) processing
- scientific article; zbMATH DE number 49601 (Why is no real title available?)
This page was built for publication: Scheduling job shops with batch machines using the Lagrangian relaxation technique
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1383473)
