Single machine scheduling to minimize the number of late jobs under uncertainty.

DOI10.1016/S0165-0114(02)00505-5zbMath1045.90033OpenAlexW1986661310MaRDI QIDQ1413868

Milan Vlach, Shao Chin Sung

Publication date: 17 November 2003

Published in: Fuzzy Sets and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0165-0114(02)00505-5

zbMATH Keywords

SchedulingSingle machineCombinatorial problemsNumber of late jobs

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items

SOME GENERAL PROPERTIES OF A FUZZY SINGLE MACHINE SCHEDULING PROBLEM ⋮ A possibilistic approach to sequencing problems with fuzzy parameters ⋮ Survey on fuzzy shop scheduling

Cites Work

• Note—A Note on Single Machine Sequencing with Random Processing Times
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
• Unnamed Item
• Unnamed Item
• Unnamed Item