Scheduling problems on parallel machines with machine-dependent generalized due-dates
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3231692 (Why is no real title available?)
- A note on the SPT heuristic for solving scheduling problems with generalized due dates
- A single machine scheduling with generalized and periodic due dates to minimize total deviation
- Algorithms for two bottleneck optimization problems
- Integer Programming with a Fixed Number of Variables
- Minimizing tardiness scheduling measures with generalized due-dates and a maintenance activity
- Minimizing the number of tardy jobs with generalized due-dates and position-dependent processing times
- Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates
- Minimizing total late work on a single machine with generalized due-dates
- Min–max version of single-machine scheduling with generalized due dates under scenario-based uncertainty
- On the complexity of generalized due date scheduling problems
- On the tractability of hard scheduling problems with generalized due-dates with respect to the number of different due-dates
- Scheduling with common due date assignment to minimize generalized weighted earliness-tardiness penalties
- Scheduling with generalized and periodic due dates under single- and two-machine environments
- Two-machine ordered flow shop scheduling with generalized due dates
This page was built for publication: Scheduling problems on parallel machines with machine-dependent generalized due-dates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6983092)