Job Tardiness in Unequal Parallel Processor Systems

DOI10.1080/02522667.1989.10698988MaRDI QIDQ3035127zbMATH OpenOpenAlexFDO

Authors Parthasarati Dileepan, Tapan Sen

Publication date 1989

Published in Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02522667.1989.10698988

zbMATH Keywords

heuristicsindependent jobsmakespanmeasure of job tardinessparallel processorsstatistical analysis

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Theory of operating systems (68N25) Deterministic scheduling theory in operations research (90B35) Boolean programming (90C09)

Recommendations

• Scheduling on parallel identical machines to minimize total tardiness
• Minimizing total tardiness in an unrelated parallel-machine scheduling problem
• Minimizing maximum tardiness and number of tardy jobs on parallel machines subject to minimum flow-time
• Minimizing the number of tardy jobs for m parallel machines
• Evaluating scheduling heuristics for non-identical parallel processors

Cites work

• Algorithms for Scheduling Independent Tasks
• Bounds for LPT Schedules on Uniform Processors
• Dynamic Programming Solution of Sequencing Problems with Precedence Constraints
• Evaluation of a Heuristic for Scheduling Independent Jobs on Parallel Identical Processors
• Preemptive Scheduling of Uniform Processor Systems
• Scheduling with deadlines and loss functions
• Scheduling with Deadlines and Loss Functions on k Parallel Machines

Cited in

(3)

• Minimizing the number of tardy jobs for m parallel machines
• Evaluating scheduling heuristics for non-identical parallel processors
• Heuristics for minimizing mean tardiness form parallel machines

This page was built for publication: Job Tardiness in Unequal Parallel Processor Systems

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