Pages that link to "Item:Q5548719"
From MaRDI portal
The following pages link to An <i>n</i> Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs (Q5548719):
Displaying 50 items.
- Two-person cooperative games on scheduling problems in outpatient pharmacy dispensing process (Q887883) (← links)
- Algorithms and complexity analysis for robust single-machine scheduling problems (Q906553) (← links)
- A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs (Q922286) (← links)
- Single-machine scheduling against due dates with past-sequence-dependent setup times (Q933538) (← links)
- Minimizing the number of late jobs for the permutation flowshop problem with secondary resources (Q941545) (← links)
- Complexity of single machine scheduling problems under scenario-based uncertainty (Q943794) (← links)
- Bicriterion scheduling with equal processing times on a batch processing machine (Q947947) (← links)
- Single-machine scheduling under the job rejection constraint (Q964407) (← links)
- Sequencing a single machine with due dates and deadlines: An ILP-based approach to solve very large instances (Q969755) (← links)
- Genetic algorithm for bi-criteria single machine scheduling problem of minimizing maximum earliness and number of tardy jobs (Q990722) (← links)
- Priority algorithms for the subset-sum problem (Q1029701) (← links)
- Single machine scheduling problems with position-dependent processing times (Q1032015) (← links)
- The counting complexity of a simple scheduling problem (Q1038110) (← links)
- Scheduling jobs under decreasing linear deterioration (Q1041725) (← links)
- New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs (Q1044141) (← links)
- Scheduling on machines with variable service rates (Q1094326) (← links)
- k-optimal solution sets for some polynomially solvable scheduling problems (Q1121169) (← links)
- A branch and bound algorithm to minimize the number of late jobs in a permutation flow-shop (Q1121779) (← links)
- Minimizing the number of tardy jobs for \(m\) parallel machines (Q1127174) (← links)
- Multiple and bicriteria scheduling: A literature survey (Q1130028) (← links)
- Minimizing late jobs in the general one machine scheduling problem (Q1130035) (← links)
- Complexity results for scheduling chains on a single machine (Q1142687) (← links)
- On the complexity of generalized due date scheduling problems (Q1175769) (← links)
- Single machine sequencing with nonlinear multicriteria cost functions: An application of generalized dynamic programming (Q1185994) (← links)
- Local search heuristics for single-machine scheduling with batching to minimize the number of late jobs (Q1266534) (← links)
- Minimizing mean tardiness subject to unspecified minimum number tardy for a single machine (Q1266653) (← links)
- Single machine scheduling subject to deadlines and resource dependent processing times (Q1278308) (← 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)
- Single-machine scheduling to minimize earliness and number of tardy jobs (Q1321352) (← links)
- An optimal scheduling algorithm for preemptable real-time tasks (Q1321836) (← links)
- An ordered independence system and its applications to scheduling problems (Q1330565) (← links)
- Scheduling jobs under simple linear deterioration (Q1332800) (← links)
- Incorporating preference information into multi-objective scheduling (Q1333459) (← links)
- The stochastic single machine scheduling problem with earliness and tardiness costs (Q1333461) (← links)
- Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the `Tower of Sets' property (Q1341403) (← links)
- Single-machine scheduling to minimize the weighted number of early and tardy agreeable jobs (Q1342333) (← links)
- Flowshop scheduling with dominant machines (Q1342341) (← links)
- Single-machine scheduling with trade-off between number of tardy jobs and resource allocation (Q1362988) (← links)
- Approximate algorithms for the \(P\parallel C_{\max}\) problem (Q1367883) (← links)
- Single machine scheduling with discretely controllable processing times (Q1373460) (← links)
- Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity (Q1399579) (← links)
- Genetic algorithms to minimize the weighted number of late jobs on a single machine. (Q1410613) (← links)
- Minimizing the weighted number of tardy jobs on a two-machine flow shop. (Q1413849) (← links)
- Single machine scheduling to minimize the number of late jobs under uncertainty. (Q1413868) (← links)
- A note on the maximum number of on-time jobs on parallel identical machines. (Q1422366) (← links)
- Parallel machine scheduling with a common server (Q1566574) (← links)
- Parallel machine scheduling with splitting jobs (Q1570839) (← links)
- Minimizing the weighted number of tardy jobs and maximum tardiness in relocation problem with due date constraints (Q1610141) (← links)
- Single machine scheduling with assignable due dates (Q1613425) (← links)
