Algorithm for minimizing weighted earliness penalty in single-machine problem
From MaRDI portal
Publication:706977
DOI10.1016/J.EJOR.2003.07.017zbMATH Open1071.90020OpenAlexW2166180443MaRDI QIDQ706977FDOQ706977
Authors: Supachai Pathumnakul, Pius J. Egbelu
Publication date: 9 February 2005
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2003.07.017
Recommendations
- Algorithms for a class of single-machine weighted tardiness and earliness problems
- Single machine scheduling to minimize weighted earliness subject to maximum tardiness
- OPTIMAL SINGLE-MACHINE SCHEDULING FOR MINIMIZING THE SUM OF EARLINESS AND TARDINESS PENALTIES
- Minimizing weighted earliness and tardiness penalties in single-machine scheduling with idle time permitted
- Single machine scheduling to minimize weighted earliness subject to no tardy jobs
- Algorithms for a class of single-machine weighted tardiness and earliness problems. Erratum
- On the complexity of the single machine scheduling problem minimizing total weighted delay penalty
- Algorithms for Scheduling a Single Machine to Minimize the Weighted Number of Late Jobs
- Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs
- Approximation algorithms for minimizing the total weighted tardiness on a single machine
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Sequencing with Earliness and Tardiness Penalties: A Review
- The Single Machine Early/Tardy Problem
- Single machine scheduling to minimize weighted earliness subject to no tardy jobs
- Scheduling a single machine to minimize earliness penalties subject to the SLK due-date determination method
- A fixed interval due-date scheduling problem with earliness and due-date costs
Cited In (5)
- Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs
- Single-machine scheduling with linear decreasing deterioration to minimize earliness penalties
- Complexities and algorithms for synchronized scheduling of parallel machine assembly and air transportation in consumer electronics supply chain
- A survey of single machine scheduling to minimize weighted number of tardy jobs
- Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem
This page was built for publication: Algorithm for minimizing weighted earliness penalty in single-machine problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q706977)