A note on minimizing the weighted sum of tardy and early completion penalties in a single machine: A case of small common due date
From MaRDI portal
Publication:1278532
DOI10.1016/S0377-2217(95)00363-0zbMath0917.90182MaRDI QIDQ1278532
Publication date: 22 February 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
schedulingearlinesssingle machinecommon due datetardinessproportional weightsweighted absolute deviation of completion times
Related Items
A branch-and-bound algorithm for the early/tardy machine scheduling problem with a common due-date and sequence-dependent setup time, Minimizing the sum of earliness/tardiness in identical parallel machines schedule with incompatible job families: An improved MIP approach, Minimizing total earliness and tardiness on a single machine using a hybrid heuristic, Scheduling in a two-machine flowshop with batch processing machine(s) for earliness/tardiness measure under a common due date, Multicriteria scheduling, Parallel machine earliness and tardiness scheduling with proportional weights
Cites Work
- Unnamed Item
- Scheduling around a small common due date
- Minimizing weighted number of tardy jobs and weighted earliness-tardiness penalties about a common due date
- Minimizing the sum of absolute lateness in single-machine and multimachine scheduling
- Minimizing the average deviation of job completion times about a common due date
- Sequencing with Earliness and Tardiness Penalties: A Review
- Minimizing mean absolute deviation of completion times about a common due date
- Single- and multiple-processor models for minimizing completion time variance
- Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date
- Weighted-Tardiness Scheduling on Parallel Machines with Proportional Weights
- 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
- Single Stage Minimum Absolute Lateness Problem with a Common Due Date on Non-Identical Machines