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

DOI10.1016/J.EJOR.2006.05.036zbMATH Open1121.90064OpenAlexW2133204269MaRDI QIDQ872264FDOQ872264

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

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

zbMATH Keywords

schedulingsingle machinestochasticearly and tardy jobs

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

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

Cited In (23)

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

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)