Minimizing the number of late jobs in a stochastic setting using a chance constraint

DOI10.1007/S10951-007-0034-8zbMATH Open1168.90484OpenAlexW2019293698MaRDI QIDQ835575FDOQ835575

Authors: Marjan Van Den Akker, Han Hoogeveen 

Publication date: 28 August 2009

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-007-0034-8

Recommendations

• Single Machine Stochastic Scheduling: Minimizing the Number of Tardy Jobs
• Minimizing the number of tardy jobs with stochastically-ordered processing times
• Single machine scheduling with stochastic processing times or stochastic due-date to minimize the number of early and tardy jobs
• Single-machine scheduling to stochastically minimize maximum lateness
• Scheduling stochastic jobs on a single machine to minimize weighted number of tardy jobs

zbMATH Keywords

schedulingsingle machineNP-hardnesssequencingstochastic processing timesDynamic programmingnumber of late jobsChance constraintMinimum success probability

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Cites Work

• A Functional Equation and its Application to Resource Allocation and Sequencing Problems
• Optimal Sequencing of a Single Machine Subject to Precedence Constraints
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
• A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
• Title not available (Why is that?)

Cited In (14)

• Safe scheduling: Setting due dates in single-machine problems
• Multi-criteria scheduling: an agent-based approach for expert knowledge integration
• Minimizing value-at-risk in single-machine scheduling
• Single machine scheduling with release dates: a distributionally robust approach
• On maximizing the profit of a satellite launcher: selecting and scheduling tasks with time windows and setups
• Parallel Machine Scheduling Under Uncertainty: Models and Exact Algorithms
• Stochastically Minimizing Total Delay of Jobs Subject to Random Deadlines
• Distributionally robust single machine scheduling with risk aversion
• Approximation algorithms for minimizing the total weighted number of late jobs with late deliveries in two-level supply chains
• A stochastic approach for the single-machine scheduling problem to minimize total expected cost with client-dependent tardiness costs
• Stochastic single machine scheduling problem as a multi-stage dynamic random decision process
• Robust scheduling on a single machine to minimize total flow time
• Minimizing the number of tardy jobs with stochastically-ordered processing times
• Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness

This page was built for publication: Minimizing the number of late jobs in a stochastic setting using a chance constraint

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