Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem

DOI10.1016/J.EJOR.2006.05.036MaRDI QIDQ872264zbMATH OpenOpenAlexFDO

Authors Hossein M. Soroush

Publication date 27 March 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.05.036

zbMATH Keywords

schedulingsingle machinestochasticearly and tardy jobs

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Single machine scheduling with stochastic processing times or stochastic due-date to minimize the number of early and tardy jobs
• Scheduling stochastic jobs on a single machine to minimize weighted number of tardy jobs
• Stochastic single machine scheduling to minimize the weighted number of tardy jobs
• Minimising a weighted quadratic function of job lateness in the stochastic single machine scheduling problem
• On the minimization of the weighted number of tardy jobs with random processing times and deadline

Cites work

• scientific article; zbMATH DE number 3871363 (Why is no real title available?)
• scientific article; zbMATH DE number 5345854 (Why is no real title available?)
• scientific article; zbMATH DE number 1061797 (Why is no real title available?)
• scientific article; zbMATH DE number 3305564 (Why is no real title available?)
• Algorithm for minimizing weighted earliness penalty in single-machine problem
• Dynamic scheduling of stochastic jobs on a single machine
• Earliness-tardiness scheduling with setup considerations
• Inference for the crossing point of two continuous cdf's
• Machine scheduling with earliness, tardiness and non-execution penalties
• Minimizing the expected weighted number of tardy jobs in stochastic flow shops
• Note—On Baluts Algorithm and NP-Completeness for a Chance-Constrained Scheduling Problem
• Scheduling to Minimize the Number of Late Jobs When Set-Up and Processing Times are Uncertain
• Sequencing and due-date determination in the stochastic single machine problem with earliness and tardiness costs
• Sequencing jobs on a single machine with a common due data and stochastic processing times
• Sequencing with Earliness and Tardiness Penalties: A Review
• Single machine scheduling to minimize the number of early and tardy jobs
• Single-machine scheduling with exponential processing times and general stochastic cost functions
• Stochastic Scheduling with Release Dates and Due Dates
• Stochastic Single Machine Scheduling with Quadratic Early-Tardy Penalties
• The Single Machine Early/Tardy Problem
• The single-machine absolute-deviation early-tardy problem with random completion times
• The stochastic single machine scheduling problem with earliness and tardiness costs

Cited in

(26)

• Minimising a weighted quadratic function of job lateness in the stochastic single machine scheduling problem
• Minimizing the number of tardy jobs with stochastically-ordered processing times
• A polynomial time heuristic for the two-machine flowshop scheduling problem with setup times and random processing times
• Hybrid flow shop scheduling with sequence dependent family setup time and uncertain due dates
• Minimizing weighted tardiness of jobs with stochastic interruptions in parallel machines
• Heuristics for the two-machine flowshop scheduling problem to minimise makespan with bounded processing times
• Distributionally robust single machine scheduling with risk aversion
• Stochastic single machine scheduling problem as a multi-stage dynamic random decision process
• Two-machine no-wait flowshop scheduling problem with uncertain setup times to minimize maximum lateness
• Target-based distributionally robust optimization for single machine scheduling
• Minimizing the expected weighted number of tardy jobs in stochastic flow shops
• A survey of single machine scheduling to minimize weighted number of tardy jobs
• 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
• Single machine scheduling with stochastic processing times or stochastic due-date to minimize the number of early and tardy jobs
• Solving a stochastic single machine problem with initial idle time and quadratic objective
• Robust scheduling on a single machine to minimize total flow time
• On the minimization of the weighted number of tardy jobs with random processing times and deadline
• Bi-objective single machine scheduling problem with stochastic processing times
• Scheduling stochastic jobs on a single machine to minimize weighted number of tardy jobs
• Stochastic single machine scheduling to minimize the weighted number of tardy jobs
• Minimizing the Expected Weighted Number of Tardy Jobs in the Stochastic Two-Machine Flow Shop
• Distributionally robust single machine scheduling with the total tardiness criterion
• Significantly improved dominance relation for no-wait flowshop scheduling problems with uncertain setup times
• A stochastic approach for the single-machine scheduling problem to minimize total expected cost with client-dependent tardiness costs
• Single machine scheduling with release dates: a distributionally robust approach

This page was built for publication: Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem

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