Scheduling a single machine to minimize earliness penalties subject to the SLK due-date determination method

DOI10.1016/S0377-2217(97)00075-1zbMATH Open0955.90031OpenAlexW2010768874MaRDI QIDQ1291768FDOQ1291768

Authors: Xiangtong Qi, Fengsheng Tu 

Publication date: 22 February 2001

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(97)00075-1

Recommendations

• Single-machine scheduling with periodic due dates to minimize the total earliness and tardy penalty
• Earliness penalties on a single machine subject to precedence constraints: SLK due date assignment
• scientific article; zbMATH DE number 2159153
• OPTIMAL SINGLE-MACHINE SCHEDULING FOR MINIMIZING THE SUM OF EARLINESS AND TARDINESS PENALTIES
• Single-machine scheduling to minimize earliness and number of tardy jobs
• scientific article; zbMATH DE number 7448659
• Minimizing earliness and tardiness penalties in a single-machine problem with a common due date
• Single Machine Earliness-Tardiness Scheduling Problems Using the Equal–Slack Rule
• A single machine scheduling problem with earliness/tardiness and starting time penalties under a common due date
• Single machine scheduling to minimize weighted earliness subject to maximum tardiness

zbMATH Keywords

schedulingsingle machineSLK due-date determination method

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
• Title not available (Why is that?)
• Survey of scheduling research involving due date determination decisions
• Scheduling jobs with different, job-dependent earliness and tardiness penalties using the SLK method
• Scheduling with monotonous earliness and tardiness penalties
• Sequencing with Earliness and Tardiness Penalties: A Review
• A note on optimal assignment of slack due-dates in single-machine scheduling
• Single Machine Earliness-Tardiness Scheduling Problems Using the Equal–Slack Rule
• Optimal assignment of slack due-dates and sequencing in a single-machine shop
• Single machine scheduling to minimize weighted earliness subject to no tardy jobs
• Single machine scheduling to minimize the number of early and tardy jobs
• A fixed interval due-date scheduling problem with earliness and due-date costs
• Single machine scheduling to minimize weighted earliness subject to maximum tardiness
• Single machine scheduling to minimize mean absolute lateness: A heuristic solution

Cited In (7)

• A Bicriterion Approach to Due Date Assignment Scheduling in Single-Machine with Position-Dependent Weights
• Single Machine Earliness-Tardiness Scheduling Problems Using the Equal–Slack Rule
• A note on single-machine scheduling with decreasing time-dependent job processing times
• Single-machine scheduling with linear decreasing deterioration to minimize earliness penalties
• Single-machine scheduling with periodic due dates to minimize the total earliness and tardy penalty
• Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties
• Algorithm for minimizing weighted earliness penalty in single-machine problem

This page was built for publication: Scheduling a single machine to minimize earliness penalties subject to the SLK due-date determination method

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