Job sequencing and due date assignment in a single machine shop with uncertain processing times

DOI10.1016/j.ejor.2006.10.058zbMath1152.90004MaRDI QIDQ2383106

Jinfeng Yue, Yu Xia, Bintong Chen

Publication date: 5 October 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2006.10.058

zbMATH Keywords

heuristics; sequencing; Scheduling; due date assignment; distribution-free decision

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

90C59: Approximation methods and heuristics in mathematical programming

Related Items

Due-date assignment for multi-server multi-stage assembly systems, Impact of deadline intervals on behavior of solutions to the random sequencing jobs with deadlines problem, Due-window assignment scheduling problem with stochastic processing times, Solving integrated process planning, dynamic scheduling, and due date assignment using metaheuristic algorithms, Minimizing earliness and tardiness costs in stochastic scheduling, Setting due dates to minimize the total weighted possibilistic mean value of the weighted earliness-tardiness costs on a single machine, Solving a stochastic single machine problem with initial idle time and quadratic objective, The distributionally robust machine scheduling problem with job selection and sequence-dependent setup times

Cites Work

• Unnamed Item
• An algorithm for the CON due-date determination and sequencing problem
• Scheduling problems with non-regular penalty functions - a review
• Survey of scheduling research involving due date determination decisions
• Optimal assignment of slack due-dates and sequencing of jobs with random processing times on a single machine
• Earliness penalties on a single machine subject to precedence constraints: SLK due date assignment
• Single machine scheduling with assignable due dates
• Expected Value of Distribution Information for the Newsvendor Problem
• 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
• Optimal due-date assignment for a single machine sequencing problem with random processing times
• 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
• Single-machine scheduling to minimize absolute deviation of completion times from a common due date
• On the Assignment of Optimal Due Dates
• Minimizing Variation of Flow Time in Single Machine Systems
• The Distribution Free Newsboy Problem: Review and Extensions
• Scheduling problems with random processing times under expected earliness/tardiness costs
• Single–machine scheduling with random machine breakdowns and randomly compressible processing times
• The single-machine absolute-deviation early-tardy problem with random completion times
• Scheduling jobs with random processing times on a single machine subject to stochastic breakdowns to minimize early-tardy penalties