Pages that link to "Item:Q3804431"
From MaRDI portal
The following pages link to Algorithms for Scheduling a Single Machine to Minimize the Weighted Number of Late Jobs (Q3804431):
Displayed 24 items.
- A binary multiple knapsack model for single machine scheduling with machine unavailability (Q342369) (← links)
- A survey of single machine scheduling to minimize weighted number of tardy jobs (Q380558) (← links)
- Minimizing the weighted number of tardy jobs on a single machine with release dates (Q852934) (← links)
- Sequencing a single machine with due dates and deadlines: An ILP-based approach to solve very large instances (Q969755) (← links)
- Minimizing late jobs in the general one machine scheduling problem (Q1130035) (← links)
- A note on sequencing jobs with deadlines problem (Q1194777) (← links)
- Optimal due-date assignment and sequencing (Q1197665) (← links)
- The selection and scheduling of textile orders with due dates (Q1263516) (← links)
- A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem (Q1278537) (← links)
- An O\((n^4)\) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs (Q1306357) (← links)
- Parallel machine scheduling to minimize costs for earliness and number of tardy jobs (Q1315994) (← links)
- Genetic algorithms to minimize the weighted number of late jobs on a single machine. (Q1410613) (← links)
- An integrated dispatching model for rail yards operations. (Q1423441) (← links)
- Using short-term memory to minimize the weighted number of late jobs on a single machine. (Q1812007) (← links)
- Minimizing the weighted number of tardy jobs on a single machine (Q1869424) (← links)
- Multivariate composite distributions for coefficients in synthetic optimization problems (Q1969891) (← links)
- Optimally rescheduling jobs with a last-in-first-out buffer (Q2066687) (← links)
- Minimizing the weighted number of tardy jobs on a single machine: strongly correlated instances (Q2076814) (← links)
- A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems (Q2102995) (← links)
- A family of composite discrete bivariate distributions with uniform marginals for simulating realistic and challenging optimization-problem instances (Q2629710) (← links)
- Minimizing weighted number of tardy jobs and weighted earliness-tardiness penalties about a common due date (Q2638926) (← links)
- Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine (Q4432721) (← links)
- A new dominance rule to minimize total weighted tardiness with unequal release dates. (Q5952443) (← links)
- Algorithms for rescheduling jobs with a LIFO buffer to minimize the weighted number of late jobs (Q6116027) (← links)