scientific article; zbMATH DE number 3632203
From MaRDI portal
Publication:4193237
Cited in
(7)- Batch scheduling to minimize maximum lateness
- Scheduling the production of two-component jobs on a single machine
- Approximation algorithms for problems in scheduling with set-ups
- A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines
- Using profit maximizing scheduling models to structure operational trade-offs and manufacturing strategy issues
- An online algorithm for a problem in scheduling with set-ups and release times
- Dynamic programming algorithms for scheduling parallel machines with family setup times
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4193237)
