Algorithms for a class of single-machine weighted tardiness and earliness problems
From MaRDI portal
Publication:2277355
Recommendations
- A decision theory based scheduling procedure for single-machine weighted earliness and tardiness problems
- Single machine scheduling to minimize weighted earliness subject to no tardy jobs
- Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs
- A survey of algorithms for the single machine total weighted tardiness scheduling problem
- Single machine scheduling to minimize weighted earliness subject to maximum tardiness
Cites work
- A decomposition algorithm for the single machine total tardiness problem
- Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
- Dynamic Programming State-Space Relaxation for Single-Machine Scheduling
- Minimizing mean absolute deviation of completion times about a common due date
- Minimizing the average deviation of job completion times about a common due date
- Minimizing the sum of absolute lateness in single-machine and multimachine scheduling
- One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
- Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties
- Sequencing with Earliness and Tardiness Penalties: A Review
- Technical Note—Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties
- The Single Machine Problem with Quadratic Penalty Function of Completion Times: A Branch-and-Bound Solution
- Weighted-Tardiness Scheduling on Parallel Machines with Proportional Weights
Cited in
(43)- A branch and bound approach for single machine scheduling with earliness and tardiness penalties
- Counting and enumeration complexity with application to multicriteria scheduling
- Single machine scheduling with family setups to minimize total earliness and tardiness
- Single machine scheduling to minimize weighted earliness subject to no tardy jobs
- An algorithm to program a single machine with penalties for earliness and tardiness.
- A branch-and-bound algorithm for a single machine sequencing to minimize the sum of maximum earliness and tardiness with idle insert
- Single-machine scheduling to minimize the weighted number of early and tardy agreeable jobs
- Optimal scheduling for a single machine to minimize the sum of maximum earliness and tardiness considering idle insert
- Minimizing earliness and tardiness costs in stochastic scheduling
- Branch-and-bound algorithms for minimizing total earliness and tardiness in a two-machine permutation flow shop with unforced idle allowed
- Ant colony systems for the single-machine total weighted earliness tardiness scheduling problem
- A decision theory based scheduling procedure for single-machine weighted earliness and tardiness problems
- Minmax scheduling with job-classes and earliness-tardiness costs
- A note on the single-machine scheduling problem with minimum weighted completion time and maximum allowable tardiness
- A Heuristic Algorithm for Sequencing on One Machine to Minimize Total Tardiness
- An Exact Algorithm for the Single-Machine Earliness–Tardiness Scheduling Problem
- A heuristic for single machine scheduling with early and tardy costs
- Algorithms for a class of single-machine weighted tardiness and earliness problems. Erratum
- Minimizing total earliness and tardiness on a single machine using a hybrid heuristic
- Precedence theorems and dynamic programming for the single-machine weighted tardiness problem
- Single machine scheduling with symmetric earliness and tardiness penalties
- Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs
- A genetic algorithm for job sequencing problems with distinct due dates and general early-tardy penalty weights
- Algorithms for job scheduling problems with distinct time windows and general earliness/tardiness penalties
- Preemption in single machine earliness/tardiness scheduling
- A neighbourhood scheme with a compressed solution space for the early/tardy scheduling problem
- scientific article; zbMATH DE number 3848954 (Why is no real title available?)
- Weighted tardiness for the single machine scheduling problem:an examination of precedence theorem productivity
- Modeling single machine preemptive scheduling problems for computational efficiency
- New Precedence Theorems for One-Machine Weighted Tardiness
- A survey of algorithms for the single machine total weighted tardiness scheduling problem
- A comparison of lower bounds for the single-machine early/tardy problem
- A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time
- Earliness and tardiness single machine scheduling with proportional weights
- A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems
- Single machine earliness and tardiness scheduling
- A greedy heuristic for the mean tardiness sequencing problem
- Dispatching heuristics for the single machine weighted quadratic tardiness scheduling problem
- Earliness-tardiness scheduling with setup considerations
- Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties
- A recovering beam search algorithm for the single machine just-in-time scheduling problem
- Algorithm for minimizing weighted earliness penalty in single-machine problem
- scientific article; zbMATH DE number 4085401 (Why is no real title available?)
This page was built for publication: Algorithms for a class of single-machine weighted tardiness and earliness problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2277355)
