Minimizing maximum tardiness and number of tardy jobs on parallel machines subject to minimum flow-time

DOI10.1057/PALGRAVE.JORS.2601638MaRDI QIDQ4661237zbMATHOpenAlexFDO

Authors

Publication date 4 April 2005

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1057/palgrave.jors.2601638

zbMATH Keywords

lower boundsparallel machine schedulingmaximum tardinessflow-timetardy jobshierarchical criteria

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Minimizing the number of tardy jobs for \(m\) parallel machines
• Parallel machine scheduling with minimum number of tardy jobs: approximation and exponential algorithms
• Minimization of maximum lateness on parallel machines with sequence-dependent setup times and job release dates
• Minimizing total tardiness on parallel machines with preemptions
• Minimizing the weighted number of tardy jobs on parallel processors
• Minimizing total tardiness in an unrelated parallel-machine scheduling problem
• Minimizing maximum flowtime of jobs with arbitrary parallelizability
• An improved max-flow-based lower bound for minimizing maximum lateness on identical parallel machines
• Minimization of earliness, tardiness and due date penalties on uniform parallel machines with identical jobs
• Minimizing the weighted number of tardy jobs on multiple machines: a review

Cited in

(11)

• Generating efficient schedules for identical parallel machines involving flow-time and tardy jobs
• Fuzzy bi-criteria scheduling on parallel machines involving weighted flow time and maximum tardiness
• Impact of worker and shop flexibility on assembly cells
• Job Tardiness in Unequal Parallel Processor Systems
• Parallel machine scheduling with minimum number of tardy jobs: approximation and exponential algorithms
• A note on the maximum number of on-time jobs on parallel identical machines.
• The joint load balancing and parallel machine scheduling problem
• Bicriteria multi-machine scheduling with equal processing times subject to release dates
• Scheduling uniform parallel machines subject to a secondary resource to minimize the number of tardy jobs
• Minimum weighted number of tardy jobs on an \(m\)-machine flow-shop with a critical machine
• A tardiness-augmented approximation scheme for rejection-allowed multiprocessor rescheduling

This page was built for publication: Minimizing maximum tardiness and number of tardy jobs on parallel machines subject to minimum flow-time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4661237)