A decision theory based scheduling procedure for single-machine weighted earliness and tardiness problems
From MaRDI portal
Publication:1278309
DOI10.1016/0377-2217(96)00133-6zbMath0953.90526OpenAlexW2114868543MaRDI QIDQ1278309
Publication date: 22 February 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(96)00133-6
Related Items
On the flexibility of a decision theory-based heuristic for single machine scheduling ⋮ Preemption in single machine earliness/tardiness scheduling ⋮ Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs ⋮ Dynamic non-preemptive single machine scheduling ⋮ Single machine scheduling with unequal release times and idle insert for minimizing the sum of maximum earliness and tardiness ⋮ Complexities and algorithms for synchronized scheduling of parallel machine assembly and air transportation in consumer electronics supply chain ⋮ Heuristic algorithms for unrelated parallel machine scheduling with a common due date, release dates, and linear earliness and tardiness penalties ⋮ A recovering beam search algorithm for the single machine just-in-time scheduling problem
Cites Work
- Unnamed Item
- Unnamed Item
- Scheduling about a common due date with earliness and tardiness penalties
- Tactically delayed versus non-delay scheduling: An experimental investigation
- An alternative proof of optimality for the common due-date assignment problem
- Scheduling around a small common due date
- Scheduling to minimize weighted earliness and tardiness about a common due-date
- On the general solution for a class of early/tardy problems
- Completion time variance minimization on a single machine is difficult
- Single machine scheduling to minimize mean absolute lateness: A heuristic solution
- Algorithms for a class of single-machine weighted tardiness and earliness problems
- Scheduling with monotonous earliness and tardiness penalties
- Technical Note—Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties
- 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
- Determination of an optimal common due date and optimal sequence in a single machine job shop
- Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date
- The Single Machine Early/Tardy Problem
- One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
- Single-machine scheduling to minimize absolute deviation of completion times from a common due date
- Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
- 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
- Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties
- New Lower and Upper Bounds for Scheduling Around a Small Common Due Date
- Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due dates
- Single-machine scheduling with early and tardy completion costs
- Note—A Note on the Minimization of Mean Squared Deviation of Completion Times About a Common Due Date
- An evaluation of scheduling heuristics for dynamic single-processor scheduling with early/tardy costs
