Single Machine Stochastic Scheduling: Minimizing the Number of Tardy Jobs

DOI10.1080/01966324.1994.10737380zbMath0828.90062OpenAlexW2015920486WikidataQ58270733 ScholiaQ58270733MaRDI QIDQ4842698

Chen-Sin Lin

Publication date: 7 September 1995

Published in: American Journal of Mathematical and Management Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01966324.1994.10737380

zbMATH Keywords

single machine schedulingtardy jobsstochastic ordering of processing times

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Unnamed Item
• Unnamed Item
• Minimizing the expected weighted number of tardy jobs in stochastic flow shops
• A polynomial time algorithm for a chance-constrained single machine scheduling problem
• Chance-Constrained Programming
• Note—On Baluts Algorithm and NP-Completeness for a Chance-Constrained Scheduling Problem
• A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
• Single machine sequencing with random processing times and random due‐dates
• A Simple Optimality Proof of Moore's Sequencing Algorithm
• Scheduling to Minimize the Number of Late Jobs When Set-Up and Processing Times are Uncertain

This page was built for publication: Single Machine Stochastic Scheduling: Minimizing the Number of Tardy Jobs