Single machine scheduling to minimize weighted earliness subject to maximum tardiness
From MaRDI portal
(Redirected from Publication:1373894)
Recommendations
- Trade-off solutions in a single-machine scheduling problem for minimizing total earliness and maximum tardiness
- 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 branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem
- Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem
Cites work
- A Note on the V-shaped Property in One-Machine Scheduling
- Earliness-tardiness scheduling problems with a common delivery window
- Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
- Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date
- Scheduling problems with non-regular penalty functions - a review
- Scheduling with monotonous earliness and tardiness penalties
- Sequencing with Earliness and Tardiness Penalties: A Review
- Single machine scheduling to minimize mean absolute lateness: A heuristic solution
- Single machine scheduling to minimize weighted earliness subject to no tardy jobs
Cited in
(25)- Single machine scheduling to minimize weighted earliness subject to no tardy jobs
- A decision theory based scheduling procedure for single-machine weighted earliness and tardiness problems
- Scheduling a single machine to minimize earliness penalties subject to the SLK due-date determination method
- Single machine lot scheduling to minimize the total weighted (discounted) completion time
- Single machine scheduling with symmetric earliness and tardiness penalties
- Lot scheduling on a single machine to minimize the (weighted) number of tardy orders
- Algorithms for a class of single-machine weighted tardiness and earliness problems
- Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs
- Single-machine scheduling with production and rejection costs to minimize the maximum earliness
- Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem with availability constraint
- Trade-off solutions in a single-machine scheduling problem for minimizing total earliness and maximum tardiness
- Minimizing the weighted sum of maximum earliness and maximum tardiness costs on a single machine with periodic preventive maintenance
- Minimizing the maximum of job with weighted lateness in a single machine problem
- A note on the single-machine scheduling problem with minimum weighted completion time and maximum allowable tardiness
- Weighted Tardiness Single Machine Scheduling with Proportional Weights
- Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due dates
- Minimizing weighted earliness and tardiness penalties in single-machine scheduling with idle time permitted
- Flow shop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date
- A no-delay single machine scheduling problem to minimize total weighted early and late work
- A note on lot scheduling on a single machine to minimize maximum weighted tardiness
- Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem
- Integrated production and transportation scheduling problem under nonlinear cost structures
- Algorithm for minimizing weighted earliness penalty in single-machine problem
- Preemption in single machine earliness/tardiness scheduling
- A faster algorithm for the maximum weighted tardiness problem
This page was built for publication: Single machine scheduling to minimize weighted earliness subject to maximum tardiness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1373894)
