Minimizing weighted number of tardy jobs and weighted earliness-tardiness penalties about a common due date
From MaRDI portal
Publication:2638926
DOI10.1016/0305-0548(91)90098-CzbMath0717.90037MaRDI QIDQ2638926
Chung-Yee Lee, Chen-Sin Lin, Surya Liman Danusaputro
Publication date: 1991
Published in: Computers \& Operations Research (Search for Journal in Brave)
common due dateearliness-tardiness penaltiesnon-preemptive, single-machine schedulingweighted sum of tardy jobs
Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Simultaneous minimization of total completion time and total deviation of job completion times, Due window scheduling for parallel machines, Earliness-tardiness scheduling problems with a common delivery window, Minimizing weighted number of tardy jobs and weighted earliness-tardiness penalties about a common due date, A sequential exchange approach for minimizing earliness-tardiness penalties of single-machine scheduling with a common due date, 0-1 Quadratic programming approach for optimum solutions of two scheduling problems, On the fixed interval due-date scheduling problem, The weighted common due date single machine scheduling problem revisited, A fully polynomial time approximation scheme for weighted job-dependent earliness-tardiness problem with agreeable ratios, Scheduling with common due date assignment to minimize generalized weighted earliness-tardiness penalties, Exponential neighborhood search for a parallel machine scheduling problem, Finding efficient make-to-order production and batch delivery schedules, Single-machine scheduling with a common due window, Capacitated two-parallel machines scheduling to minimize sum of job completion times, Scheduling of storage/retrieval orders under a just-in-time environment, Single machine weighted earliness-tardiness penalty problem with a common due date, Minimizing total completion time and total deviation of job completion times from a restrictive due-date, Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates, Parallel machine scheduling with a common due window, Scheduling about a given common due date to minimize mean squared deviation of completion times, Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs, \(V\)-shape property for job sequences that minimize the expected completion time variance, Scheduling with batch setup times and earliness-tardiness penalties, A note on minimizing the weighted sum of tardy and early completion penalties in a single machine: A case of small common due date, Scheduling about a common due date with job-dependent asymmetric earlines and tardiness penalties, On scheduling to minimize earliness-tardiness and batch delivery costs with a common due date, A survey of the state-of-the-art of common due date assignment and scheduling research
Cites Work
- Scheduling problems with non-regular penalty functions - a review
- Minimizing weighted number of tardy jobs and weighted earliness-tardiness penalties about a common due date
- Sequencing with Earliness and Tardiness Penalties: A Review
- Single- and multiple-processor models for minimizing completion time variance
- Algorithms for Scheduling a Single Machine to Minimize the Weighted Number of Late Jobs
- Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date
- Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
- Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item