Stochastic scheduling to minimize expected maximum lateness

DOI10.1016/J.EJOR.2007.06.015zbMATH Open1146.90431OpenAlexW2018634397MaRDI QIDQ2482822FDOQ2482822

Authors: Xianyi Wu, Xian Zhou 

Publication date: 24 April 2008

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

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

Recommendations

• Dynamic scheduling of stochastic jobs on a single machine
• Single-machine scheduling to stochastically minimize maximum lateness
• A stochastic single machine scheduling with random processing time
• Scheduling stochastic jobs with due dates on parallel machines
• One machine scheduling to minimize expected mean tardiness. II

zbMATH Keywords

due datesstochastic schedulingdynamic programming algorithmsexpected maximum lateness

Mathematics Subject Classification ID

Dynamic programming (90C39) Stochastic scheduling theory in operations research (90B36)

Cites Work

• Optimal Sequencing of a Single Machine Subject to Precedence Constraints
• Preemptive scheduling of independent jobs on parallel machines subject to financial constraints
• Scheduling unit-time tasks with integer release times and deadlines
• Title not available (Why is that?)
• Title not available (Why is that?)
• On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
• Some simple scheduling algorithms
• General stochastic single-machine scheduling with regular cost functions
• Two Approaches to Problems of Resource Allocation among Project Activities -- A Comparative Study
• Preemptive Scheduling with Due Dates
• Preemptive scheduling with staircase and piecewise linear resource availability
• Single-machine scheduling with exponential processing times and general stochastic cost functions

Cited In (22)

• Inverse scheduling with maximum lateness objective
• Safe scheduling: Setting due dates in single-machine problems
• Single-machine scheduling to stochastically minimize maximum lateness
• Stochastic scheduling problems with general position-based learning effects and stochastic breakdowns
• Distributionally robust scheduling on parallel machines under moment uncertainty
• Setting due dates in a stochastic single machine environment
• Minimizing earliness and tardiness costs in stochastic scheduling
• Stochastically Minimizing Total Delay of Jobs Subject to Random Deadlines
• A clearing function based bid-price approach to integrated order acceptance and release decisions
• Distributionally robust single machine scheduling with risk aversion
• Stochastic Flow-Shop Scheduling with Lateness-Related Performance Measures
• A stochastic JIT scheduling problem
• Scheduling with compressible and stochastic release dates
• A novel competitive co-evolutionary quantum genetic algorithm for stochastic job shop scheduling problem
• Scheduling independent jobs with stochastic processing times and a common due date on parallel and identical machines
• Robust scheduling on a single machine to minimize total flow time
• An uncertain programming model for single machine scheduling problem with batch delivery
• Forecasting policies for scheduling a stochastic due date job shop
• A novel parallel quantum genetic algorithm for stochastic job shop scheduling
• Title not available (Why is that?)
• Target-based distributionally robust optimization for single machine scheduling
• Scheduling multi-mode projects under uncertainty to optimize cash flows: a Monte Carlo ant colony system approach

This page was built for publication: Stochastic scheduling to minimize expected maximum lateness

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2482822)