Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs

DOI10.1016/j.ejor.2008.01.029zbMath1161.90008OpenAlexW2057559771MaRDI QIDQ2378377

Benjamin P.-C. Yen, Guohua Wan

Publication date: 8 January 2009

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2008.01.029

zbMATH Keywords

schedulingearlinesssingle machinenumber of tardy jobsdual criteria

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (9)

A survey on scheduling problems with due windows ⋮ An exact algorithm for the bi-objective timing problem ⋮ A multi-objective optimization for preemptive identical parallel machines scheduling problem ⋮ A survey of single machine scheduling to minimize weighted number of tardy jobs ⋮ A hybrid meta-heuristic algorithm to minimize the number of tardy jobs in a dynamic two-machine flow shop problem ⋮ Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem with availability constraint ⋮ Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem ⋮ Scheduling with time-of-use costs ⋮ A meta-heuristic to solve the just-in-time job-shop scheduling problem

Cites Work

• Unnamed Item
• Unnamed Item
• Algorithm for minimizing weighted earliness penalty in single-machine problem
• Single machine scheduling to minimize weighted earliness subject to no tardy jobs
• Multiple and bicriteria scheduling: A literature survey
• A decision theory based scheduling procedure for single-machine weighted earliness and tardiness problems
• Complexity of single machine, multi-criteria scheduling problems
• Single machine scheduling to minimize weighted earliness subject to maximum tardiness
• A heuristic for single machine scheduling with early and tardy costs
• Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties
• Using genetic algorithms for single-machine bicriteria scheduling problems
• Minimizing earliness and tardiness penalties in a single-machine problem with a common due date
• A simulated annealing approach to bicriteria scheduling problems on a single machine
• Stochastic Scheduling on Parallel Machines Subject to Random Breakdowns to Minimize Expected Costs for Earliness and Tardy Jobs
• Sequencing with Earliness and Tardiness Penalties: A Review
• A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
• Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due dates
• Scheduling to minimize maximum earliness and number of tardy jobs where machine idle time is allowed

This page was built for publication: Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs