Minimizing the weighted number of tardy jobs on multiple machines: a review
From MaRDI portal
Publication:2358307
Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Deterministic scheduling theory in operations research (90B35) Stochastic scheduling theory in operations research (90B36) Approximation methods and heuristics in mathematical programming (90C59)
Recommendations
- Minimizing the weighted number of tardy jobs on parallel processors
- Heterogeneous-criteria scheduling: Minimizing weighted number of tardy jobs and weighted completion time
- Scheduling parallel machines to minimize total weighted and unweighted tardiness
- Minimizing the weighted number of tardy jobs on a two-machine flow shop.
- Minimizing the number of tardy jobs for m parallel machines
Cites work
- `` Strong NP-Completeness Results
- A branch and bound algorithm to minimize the number of late jobs in a permutation flow-shop
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
- A heuristic for parallel machine scheduling with agreeable due dates to minimize the number of late jobs
- A new rule for minimizing the number of tardy jobs in dynamic flow shops
- A note on just-in-time scheduling on flow shop machines
- A Note On The Complexity Of Openshop Scheduling Problems
- A note on the complexity of the concurrent open shop problem
- A note on the maximum number of on-time jobs on parallel identical machines.
- A note: Maximizing the weighted number of just-in-time jobs on a proportionate flowshop
- A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines
- A survey of scheduling problems with setup times or costs
- A survey of single machine scheduling to minimize weighted number of tardy jobs
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- Batching identical jobs
- Complexity of preemptive minsum scheduling on unrelated parallel machines
- Complexity of scheduling problems with multi-purpose machines
- Complexity of single machine, multi-criteria scheduling problems
- Complexity results for flow-shop and open-shop scheduling problems with transportation delays
- Complexity results for parallel machine problems with a single server
- Complexity results for single-machine problems with positive finish-start time-lags
- Concurrent open shop scheduling to minimize the weighted number of tardy jobs
- Customer order scheduling to minimize the number of late jobs
- Deterministic job-shop scheduling: Past, present and future
- Enumeration of Pareto optima for a flowshop scheduling problem with two criteria
- Exact algorithms for scheduling multiple families of jobs on parallel machines
- Flowshop scheduling with dominant machines
- HEURISTIC FOR MINIMIZING THE NUMBER OF LATE JOBS ON TWO PROCESSORS
- Heuristic procedures for minimizing makespan and the number of required pallets
- How useful are preemptive schedules?
- scientific article; zbMATH DE number 3648418 (Why is no real title available?)
- scientific article; zbMATH DE number 3873052 (Why is no real title available?)
- scientific article; zbMATH DE number 1374865 (Why is no real title available?)
- scientific article; zbMATH DE number 3754389 (Why is no real title available?)
- scientific article; zbMATH DE number 3784624 (Why is no real title available?)
- scientific article; zbMATH DE number 89399 (Why is no real title available?)
- scientific article; zbMATH DE number 3550182 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2146482 (Why is no real title available?)
- scientific article; zbMATH DE number 830382 (Why is no real title available?)
- scientific article; zbMATH DE number 858991 (Why is no real title available?)
- Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity
- Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
- Is a unit-job shop not easier than identical parallel machines?
- Maximizing the weighted number of just-in-time jobs in flow shop scheduling
- Maximizing the weighted number of just-in-time jobs in~several two-machine scheduling systems
- Minimizing Maximum Lateness in a Two-Machine Open Shop
- Minimizing tardy jobs in a flowshop with common due date
- Minimizing tardy jobs in a two-stage hybrid flowshop
- Minimizing the expected weighted number of tardy jobs in stochastic flow shops
- Minimizing the number of late jobs for the permutation flowshop problem with secondary resources
- Minimizing the number of late jobs for the two-machine unit-time job-shop scheduling problem
- Minimizing the number of late jobs on unrelated machines
- Minimizing the number of tardy jobs for m parallel machines
- Minimizing the number of tardy jobs in a permutation flowshop scheduling problem with setup times and time lags constraints
- Minimizing the number of tardy jobs in the flowshop problem with operation and resource flexibility
- Minimizing the number of tardy jobs on a proportionate flowshop with general position-dependent processing times
- Minimizing the weighted number of late jobs in UET open shops
- Minimizing the weighted number of tardy jobs on a two-machine flow shop.
- Minimizing the weighted number of tardy jobs on parallel processors
- Minimum weighted number of tardy jobs on an \(m\)-machine flow-shop with a critical machine
- Multicriteria scheduling
- Multiple and bicriteria scheduling: A literature survey
- No-wait or no-idle permutation flowshop scheduling with dominating machines
- On complexity of minimizing weighted number of late jobs in unit time open shops
- On minimizing the weighted number of late jobs in unit execution time open-shops.
- On the complexity of minimizing the number of late jobs in unit time open shop
- On the complexity of two machine job-shop scheduling with regular objective functions
- One-operator, two-machine open shop and flow shop problems with setup times for machines and weighted number of tardy jobs objective
- Open shops with jobs overlap
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Parallel machine problems with equal processing times: a survey
- Parallel machine scheduling by column generation
- Parallel machine scheduling with a common server
- Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems
- Preemptive Scheduling of Two Uniform Machines to Minimize the Number of Late Jobs
- Scheduling a batching machine
- Scheduling Groups of Jobs on a Single Machine
- Scheduling identical jobs on uniform parallel machines
- Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs
- Scheduling Open Shops with Unit Execution Times to Minimize Functions of Due Dates
- Scheduling orders for multiple product types with due date related objectives
- Scheduling uniform parallel machines subject to a secondary resource to minimize the number of tardy jobs
- Scheduling unit time open shops to minimize the weighted number of late jobs
- Scheduling with batching: A review
- Sequencing with Earliness and Tardiness Penalties: A Review
- Single-machine scheduling to minimize the weighted number of early and tardy agreeable jobs
- Solving Parallel Machine Scheduling Problems by Column Generation
- Survey of scheduling research involving due date determination decisions
- Survey of scheduling research involving setup times
- Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time
- The complexity of one-machine batching problems
- The complexity of shop-scheduling problems with two or three jobs
- Transversal graphs for partially ordered sets: Sequencing, merging and scheduling problems
- Two-machine flow shop scheduling with common due window to minimize weighted number of early and tardy jobs
- Two-machine flowshop scheduling to minimize the number of tardy jobs
- Using a family of critical ratio-based approaches to minimize the number of tardy jobs in the job shop with sequence dependent setup times
- Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine
Cited in
(7)- Minimum weighted number of tardy jobs on an \(m\)-machine flow-shop with a critical machine
- Minimizing weighted tardiness of jobs with stochastic interruptions in parallel machines
- Heterogeneous-criteria scheduling: Minimizing weighted number of tardy jobs and weighted completion time
- A new branch and bound algorithm for minimizing the weighted number of tardy jobs
- Minimizing maximum tardiness and number of tardy jobs on parallel machines subject to minimum flow-time
- Bicriterion parallel-machine scheduling of equal-length jobs to minimize total tardiness and number of tardy jobs
- Revisiting the development trajectory of parallel machine scheduling
This page was built for publication: Minimizing the weighted number of tardy jobs on multiple machines: a review
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2358307)
