Minimizing earliness and tardiness costs in stochastic scheduling
From MaRDI portal
Publication:2356252
DOI10.1016/j.ejor.2013.12.011zbMath1317.90136MaRDI QIDQ2356252
Publication date: 29 July 2015
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2013.12.011
branch and bound; sequencing; stochastic scheduling; neighborhood search; due-date assignment; earliness/tardiness
90C59: Approximation methods and heuristics in mathematical programming
90B36: Stochastic scheduling theory in operations research
Related Items
SINGLE MACHINE DUE DATE ASSIGNMENT SCHEDULING PROBLEM WITH PRECEDENCE CONSTRAINTS AND CONTROLLABLE PROCESSING TIMES IN FUZZY ENVIRONMENT, A stochastic approach for the single-machine scheduling problem to minimize total expected cost with client-dependent tardiness costs, An approximate dynamic programming approach for <scp>production‐delivery</scp> scheduling under non‐stationary demand, The effect of few historical data on the performance of sample average approximation method for operating room scheduling, The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective, A clearing function based bid-price approach to integrated order acceptance and release decisions, Hybrid differential evolution optimisation for Earth observation satellite scheduling with time-dependent earliness-tardiness penalties, Due-window assignment scheduling problem with stochastic processing times, Non-indexability of the stochastic appointment scheduling problem
Cites Work
- Unnamed Item
- Setting optimal due dates in a basic safe-scheduling model
- Minimizing total earliness and tardiness on a single machine using a hybrid heuristic
- Scheduling with uncertain durations: Modeling \(\beta \)-robust scheduling with constraints
- Sequencing jobs on a single machine with a common due data and stochastic processing times
- Single machine earliness and tardiness scheduling
- A neighbourhood scheme with a compressed solution space for the early/tardy scheduling problem
- A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem
- The stochastic single machine scheduling problem with earliness and tardiness costs
- Dynamic scheduling of stochastic jobs on a single machine
- A survey of the state-of-the-art of common due date assignment and scheduling research
- Sequencing and due-date determination in the stochastic single machine problem with earliness and tardiness costs
- Machine scheduling with earliness, tardiness and non-execution penalties
- A genetic algorithm for job sequencing problems with distinct due dates and general early-tardy penalty weights
- Algorithms for a class of single-machine weighted tardiness and earliness problems
- Safe scheduling: Setting due dates in single-machine problems
- Job sequencing and due date assignment in a single machine shop with uncertain processing times
- Due date assignments and scheduling a single machine with a general earliness/tardiness cost function
- A branch and bound procedure to minimize mean absolute lateness on a single processor
- Setting due dates in a stochastic single machine environment
- Minimizing the average deviation of job completion times about a common due date
- Sequencing with Earliness and Tardiness Penalties: A Review
- Principles of Sequencing and Scheduling
- Note—On Baluts Algorithm and NP-Completeness for a Chance-Constrained Scheduling Problem
- Dynamic Programming State-Space Relaxation for Single-Machine Scheduling
- The Single Machine Early/Tardy Problem
- One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
- 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
- Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due dates
- Single machine sequencing with random processing times and random due‐dates
- Scheduling with Random Service Times
- Scheduling to Minimize the Number of Late Jobs When Set-Up and Processing Times are Uncertain
