Single-machine scheduling to minimize earliness and number of tardy jobs

DOI10.1007/BF00940450zbMath0796.90033OpenAlexW2062659340MaRDI QIDQ1321352

Helmut G. Kahlbacher, Cheng, T. C. Edwin

Publication date: 27 April 1994

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00940450

zbMATH Keywords

single machinesequencingcommon due-datetardy jobsearly jobs

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Scheduling with monotonous earliness and tardiness penalties ⋮ Earliness-tardiness scheduling problems with a common delivery window ⋮ Single machine scheduling with common due data assignment in a group technology environment ⋮ Single machine scheduling with deadlines, release and due dates ⋮ Delivery time quotation and order processing with forbidden early shipments ⋮ Parallel machine scheduling to minimize costs for earliness and number of tardy jobs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An algorithm for the CON due-date determination and sequencing problem
• Survey of scheduling research involving due date determination decisions
• Parallel machine scheduling to minimize costs for earliness and number of tardy jobs
• Optimal Due-Date Determination and Sequencing of n Jobs on a Single Machine
• Minimizing the average deviation of job completion times about a common due date
• Optimal due-date assignment in a job shop†
• Due Date Assignment for Production Systems
• Common Due Date Assignment to Minimize Total Penalty for the One Machine 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