Heterogeneous-criteria scheduling: Minimizing weighted number of tardy jobs and weighted completion time

DOI10.1016/0305-0548(94)00090-UzbMath0838.90067OpenAlexW1987344586MaRDI QIDQ1905089

Jon M. Peha

Publication date: 16 January 1996

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(94)00090-u

zbMATH Keywords

parallel machinesdeadlinesunit processing timesweighted number of tardy jobs

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (16)

New algorithms for minimizing the weighted number of tardy jobs on a single machine ⋮ Proportionate flow shop scheduling with multi-agents to maximize total gains of JIT jobs ⋮ Multi-agent scheduling in a no-wait flow shop system to maximize the weighted number of just-in-time jobs ⋮ Single machine scheduling with two competing agents and equal job processing times ⋮ Scheduling two job families on a single machine with two competitive agents ⋮ Single machine scheduling with interfering job sets ⋮ Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work ⋮ A survey of due-date related single-machine with two-agent scheduling problem ⋮ A state-of-the-art survey on multi-scenario scheduling ⋮ Parameterized multi-scenario single-machine scheduling problems ⋮ A single-machine bi-criterion scheduling problem with two agents ⋮ A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems ⋮ A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem ⋮ A Lagrangian approach to single-machine scheduling problems with two competing agents ⋮ Scheduling interfering job sets on parallel machines ⋮ Proportionate Flow Shop Scheduling with Two Competing Agents to Minimize Weighted Late Work and Weighted Number of Late Jobs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some clarifications on the bicriteria scheduling of unit execution time jobs on a single machine
• Single machine sequencing with nonlinear multicriteria cost functions: An application of generalized dynamic programming
• Scheduling unit processing time jobs on a single machine with multiple criteria
• Optimal scheduling policies for a class of queues with customer deadlines to the beginning of service
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Maximum matching in a convex bipartite graph

This page was built for publication: Heterogeneous-criteria scheduling: Minimizing weighted number of tardy jobs and weighted completion time