Minimizing the number of tardy jobs for m parallel machines
From MaRDI portal
(Redirected from Publication:1127174)
Minimizing the number of tardy jobs for \(m\) parallel machines
Minimizing the number of tardy jobs for \(m\) parallel machines
Recommendations
- Minimizing maximum tardiness and number of tardy jobs on parallel machines subject to minimum flow-time
- Minimizing the weighted number of tardy jobs on parallel processors
- Job Tardiness in Unequal Parallel Processor Systems
- Scheduling on parallel identical machines to minimize total tardiness
- Minimizing tardy jobs in a two-stage hybrid flowshop
Cites work
- scientific article; zbMATH DE number 4059106 (Why is no real title available?)
- scientific article; zbMATH DE number 3754389 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- A Review of Production Scheduling
- A parallel sequencing algorithm for minimizing total cost
- A state-of-the-art review of parallel-machine scheduling research
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- Heuristics for minimizing mean tardiness form parallel machines
- On general routing problems
- Preemptive Scheduling of Two Uniform Machines to Minimize the Number of Late Jobs
- Production scheduling of independent jobs on parallel identical processors
- Scheduling with Deadlines and Loss Functions on k Parallel Machines
- Scheduling with parallel processors and linear delay costs
- Sequencing with Earliness and Tardiness Penalties: A Review
Cited in
(20)- Generating efficient schedules for identical parallel machines involving flow-time and tardy jobs
- Minimizing the weighted number of tardy jobs on parallel processors
- Anarchy in the UJ: coordination mechanisms for minimizing the number of late jobs
- A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem
- Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times
- Reducing tardy batches by \textit{seru} production: model, exact solution, cooperative coevolution solution, and insights
- Job Tardiness in Unequal Parallel Processor Systems
- Distributionally robust scheduling on parallel machines under moment uncertainty
- An enhanced tabu search algorithm to minimize a bi-criteria objective in batching and scheduling problems on unrelated-parallel machines with desired lower bounds on batch sizes
- A two-stage stochastic programming model for the parallel machine scheduling problem with machine capacity
- A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times
- Scheduling uniform parallel machines subject to a secondary resource to minimize the number of tardy jobs
- Minimizing the weighted number of tardy jobs on multiple machines: a review
- The optimality of Moore-Hodgson algorithm
- On the integration of theoretical single-objective scheduling results for multi-objective problems
- Scheduling unrelated parallel machines with sequence-dependent setups
- An enhanced formulation and simple heuristic for scheduling jobs on unrelated parallel machines
- Minimizing maximum tardiness and number of tardy jobs on parallel machines subject to minimum flow-time
- Modeling and optimization of a spatial detection system
- Metaheuristics to solve a tasks scheduling problem in parallel identical machines with unavailability periods
This page was built for publication: Minimizing the number of tardy jobs for \(m\) parallel machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1127174)
