Minimizing the number of late jobs on a single machine under due date uncertainty
From MaRDI portal
Publication:657256
Recommendations
- Min–max version of single-machine scheduling with generalized due dates under scenario-based uncertainty
- Robust scheduling to minimize the weighted number of late jobs with interval due-date uncertainty
- Robust single machine scheduling problem with weighted number of late jobs criterion
- Single machine scheduling to minimize the number of late jobs under uncertainty.
- Minimizing The Range Of Lateness On A Single Machine Under Generalized Due Dates
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- Complexity of single machine scheduling problems under scenario-based uncertainty
- Complexity of the min-max and min-max regret assignment problems
- Matching is as easy as matrix inversion
- Maximum matching of given weight in complete and complete bipartite graphs
- Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
- Robust discrete optimization and its applications
- Scheduling Problems with Two Competing Agents
- The complexity of restricted spanning tree problems
Cited in
(19)- A state-of-the-art survey on multi-scenario scheduling
- Min–max version of single-machine scheduling with generalized due dates under scenario-based uncertainty
- Single machine scheduling problems with uncertain parameters and the OWA criterion
- Robust scheduling to minimize the weighted number of late jobs with interval due-date uncertainty
- A robust two-machine flow-shop scheduling model with scenario-dependent processing times
- Risk-averse single machine scheduling: complexity and approximation
- Single machine scheduling with multiple common due date assignment and aging effect under a deteriorating maintenance activity consideration
- Scenario based robust line balancing: Computational complexity
- Robust single machine scheduling problem with weighted number of late jobs criterion
- Minimizing the number of tardy jobs in two-machine settings with common due date
- Lawler's minmax cost algorithm: optimality conditions and uncertainty
- Lawler's minmax cost problem under uncertainty
- Complexity results for common due date scheduling problems with interval data and minmax regret criterion
- Parameterized multi-scenario single-machine scheduling problems
- Min-max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty
- Min-max and min-max (relative) regret approaches to representatives selection problem
- Single machine scheduling to minimize the number of late jobs under uncertainty.
- Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine
- Just-in-time scheduling under scenario-based uncertainty
This page was built for publication: Minimizing the number of late jobs on a single machine under due date uncertainty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q657256)
