Minimizing the number of tardy jobs for \(m\) parallel machines

DOI10.1016/0377-2217(93)E0280-BzbMath0927.90047MaRDI QIDQ1127174

Johnny C. Ho, Yih-Long Chang

Publication date: 13 August 1998

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

production schedulingparallel machineheuristicnumber of the tardy jobs

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Production models (90B30)

Related Items (17)

Minimizing the weighted number of tardy jobs on multiple machines: a review ⋮ Minimizing the weighted number of tardy jobs on parallel processors ⋮ Anarchy in the UJ: coordination mechanisms for minimizing the number of late jobs ⋮ A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times ⋮ 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 ⋮ Scheduling uniform parallel machines subject to a secondary resource to minimize the number of tardy jobs ⋮ Scheduling unrelated parallel machines with sequence-dependent setups ⋮ Reducing tardy batches by \textit{seru} production: model, exact solution, cooperative coevolution solution, and insights ⋮ An enhanced formulation and simple heuristic for scheduling jobs on unrelated parallel machines ⋮ Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times ⋮ Distributionally robust scheduling on parallel machines under moment uncertainty ⋮ On the Integration of Theoretical Single-Objective Scheduling Results for Multi-objective Problems ⋮ A two-stage stochastic programming model for the parallel machine scheduling problem with machine capacity ⋮ A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem ⋮ Metaheuristics to solve a tasks scheduling problem in parallel identical machines with unavailability periods ⋮ Modeling and Optimization of a Spatial Detection System ⋮ Generating efficient schedules for identical parallel machines involving flow-time and tardy jobs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A state-of-the-art review of parallel-machine scheduling research
• Production scheduling of independent jobs on parallel identical processors
• Sequencing with Earliness and Tardiness Penalties: A Review
• Preemptive Scheduling of Two Uniform Machines to Minimize the Number of Late Jobs
• A Review of Production Scheduling
• On general routing problems
• A parallel sequencing algorithm for minimizing total cost
• Scheduling with parallel processors and linear delay costs
• Heuristics for minimizing mean tardiness form parallel machines
• Scheduling with Deadlines and Loss Functions on k Parallel Machines
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs

This page was built for publication: Minimizing the number of tardy jobs for \(m\) parallel machines