Parallel machine scheduling to minimize costs for earliness and number of tardy jobs
From MaRDI portal
Publication:1315994
DOI10.1016/0166-218X(93)90088-6zbMath0816.90084OpenAlexW2072586897WikidataQ127110775 ScholiaQ127110775MaRDI QIDQ1315994
Cheng, T. C. Edwin, Helmut G. Kahlbacher
Publication date: 13 July 1995
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(93)90088-6
earlinessidentical parallel machinesdue date assignmentweighted number of tardy jobsindependent jobs
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)
Related Items
Scheduling with monotonous earliness and tardiness penalties, Optimal due date assignment in multi-machine scheduling environments, Minimizing the weighted number of tardy jobs on parallel processors, Two due date assignment problems in scheduling a single machine, A heuristic for single machine common due date assignment problem with different earliness/tardiness weights, Single-machine scheduling with autonomous and induced learning to minimize total weighted number of tardy jobs, Single-machine scheduling CON/SLK due window assignment problems with sum-of-processed times based learning effect, Setting due dates to minimize the total weighted possibilistic mean value of the weighted earliness-tardiness costs on a single machine, A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates, Scheduling with common due date assignment to minimize generalized weighted earliness-tardiness penalties, Due date assignments and scheduling a single machine with a general earliness/tardiness cost function, Four single-machine scheduling problems involving due date determination decisions, A two-stage stochastic programming model for the parallel machine scheduling problem with machine capacity, A unified approach for scheduling with convex resource consumption functions using positional penalties, A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem, Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments, Optimal due date assignment and resource allocation in a group technology scheduling environment, Single machine scheduling and due date assignment with positionally dependent processing times, Proportionate flow shop: New complexity results and models with due date assignment, A survey of the state-of-the-art of common due date assignment and scheduling research, Single-machine scheduling to minimize earliness and number of tardy jobs, Common due date assignment and single-machine scheduling with release times to minimize the weighted number of tardy jobs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A state-of-the-art review of parallel-machine scheduling research
- Survey of scheduling research involving due date determination decisions
- Programming in networks and graphs. On the combinatorial background and near-equivalence of network flow and matching algorithms
- Single-machine scheduling to minimize earliness and number of tardy jobs
- Sequencing with Earliness and Tardiness Penalties: A Review
- Algorithms for Scheduling a Single Machine to Minimize the Weighted Number of Late Jobs
- One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
- Minimising Waiting Time Variance in the Single Machine Problem
- On general routing problems
- 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
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
- A Simple Optimality Proof of Moore's Sequencing Algorithm
