Due-window assignment scheduling problem with stochastic processing times

DOI10.1016/j.ejor.2020.08.029zbMath1487.90342OpenAlexW3081667340MaRDI QIDQ2029364

Qing Yue, Shenghai Zhou

Publication date: 3 June 2021

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

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

zbMATH Keywords

branch-and-bound algorithmschedulingapproximationdue-window assignmentstochastic processing times

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Stochastic scheduling theory in operations research (90B36)

Related Items (1)

A survey of job shop scheduling problem: the types and models

Cites Work

• Setting optimal due dates in a basic safe-scheduling model
• Scheduling a deteriorating maintenance activity and due-window assignment
• Due-date assignment and machine scheduling in a low machine-rate situation with stochastic processing times
• On scheduling around large restrictive common due windows
• Minmax scheduling with acceptable lead-times: extensions to position-dependent processing times, due-window and job rejection
• Sequencing and due-date determination in the stochastic single machine problem with earliness and tardiness costs
• Bicriterion scheduling with a negotiable common due window and resource-dependent processing times
• Minimizing earliness and tardiness costs in stochastic scheduling
• Safe scheduling: Setting due dates in single-machine problems
• Job sequencing and due date assignment in a single machine shop with uncertain processing times
• Setting due dates in a stochastic single machine environment
• A survey on scheduling problems with due windows
• Optimal due-date assignment for a single machine sequencing problem with random processing times
• A bicriterion approach to common flow allowances due window assignment and scheduling with controllable processing times
• Probabilistic Combinatorial Optimization: Moments, Semidefinite Programming, and Asymptotic Bounds
• Due-Window Assignment for a Single Machine Scheduling with Both Deterioration and Positional Effects
• Scheduling jobs with random processing times on a single machine subject to stochastic breakdowns to minimize early-tardy penalties
• Scheduling

This page was built for publication: Due-window assignment scheduling problem with stochastic processing times