Sequencing and due-date determination in the stochastic single machine problem with earliness and tardiness costs
From MaRDI portal
Publication:1807950
DOI10.1016/S0377-2217(98)00003-4zbMath0938.90033OpenAlexW2054766195MaRDI QIDQ1807950
Publication date: 24 November 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(98)00003-4
Related Items (29)
Heuristics for the two-machine flowshop scheduling problem to minimise makespan with bounded processing times ⋮ Strategic production planning of an automated manufacturing system through market forecasting ⋮ Safe scheduling: Setting due dates in single-machine problems ⋮ Setting optimal due dates in a basic safe-scheduling model ⋮ Modelling complex assemblies as a queueing network for lead time control ⋮ Solving a stochastic single machine problem with initial idle time and quadratic objective ⋮ Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem ⋮ Optimal sequencing using a scheduling heuristic ⋮ Improving delivery reliability by a new due-date setting rule ⋮ Significantly improved dominance relation for no-wait flowshop scheduling problems with uncertain setup times ⋮ Setting due dates to minimize the total weighted possibilistic mean value of the weighted earliness-tardiness costs on a single machine ⋮ Two-machine no-wait flowshop scheduling problem with uncertain setup times to minimize maximum lateness ⋮ The control of a serial-capacitated production line for cost optimization ⋮ Minimizing total completion time in a two-machine no-wait flowshop with uncertain and bounded setup times ⋮ Two-machine flowshop scheduling problem with bounded processing times to minimize total completion time ⋮ Optimal approach for dynamic production control and workforce allocation of machining project ⋮ An approach to optimum production policy of automated manufacturing project ⋮ Due-window assignment scheduling problem with stochastic processing times ⋮ A polynomial time heuristic for the two-machine flowshop scheduling problem with setup times and random processing times ⋮ SINGLE MACHINE DUE DATE ASSIGNMENT SCHEDULING PROBLEM WITH PRECEDENCE CONSTRAINTS AND CONTROLLABLE PROCESSING TIMES IN FUZZY ENVIRONMENT ⋮ Due date assignment for multistage assembly systems ⋮ Production planning of a robot-served machine under probabilistic market demand and fixed selling time ⋮ Dynamic machining control and scheduling for multiple production projects in a deterministic period ⋮ Quantitative production scheme model for an automated manufacturing system ⋮ Johnson's problem with stochastic processing times and optimal service level ⋮ Bi-objective single machine scheduling problem with stochastic processing times ⋮ Setting due dates in a stochastic single machine environment ⋮ Trading off due-date tightness and job tardiness in a basic scheduling model ⋮ Minimizing earliness and tardiness costs in stochastic scheduling
Cites Work
- Unnamed Item
- Unnamed Item
- An algorithm for the CON due-date determination and sequencing problem
- 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
- Sequencing jobs on a single machine with a common due data and stochastic processing times
- The stochastic single machine scheduling problem with earliness and tardiness costs
- Optimal Due-Date Determination and Sequencing of n Jobs on a Single Machine
- Minimizing the average deviation of job completion times about a common due date
- Manufacturing systems with forbidden early order departure
- Sequencing with Earliness and Tardiness Penalties: A Review
- Note—On Baluts Algorithm and NP-Completeness for a Chance-Constrained Scheduling Problem
- Analytical determination of optimal TWK due-dates in a job shop
- Optimal due-date assignment for a single machine sequencing problem with random processing times
- Lot Sizes, Lead Times and In-Process Inventories
- On the Assignment of Optimal Due Dates
- Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
- A Simulation Study of Operating Policies in a Hypothetical Dual-Constrained Job Shop
- Minimising Waiting Time Variance in the Single Machine Problem
- Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties
- Scheduling to Minimize the Number of Late Jobs When Set-Up and Processing Times are Uncertain
This page was built for publication: Sequencing and due-date determination in the stochastic single machine problem with earliness and tardiness costs
