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

DOI10.1016/J.EJOR.2008.01.029zbMATH Open1161.90008OpenAlexW2057559771MaRDI QIDQ2378377FDOQ2378377

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

Recommendations

• Single machine scheduling to minimize weighted earliness subject to no tardy jobs
• Single machine scheduling to minimize weighted earliness subject to maximum tardiness
• Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem
• Algorithms for a class of single-machine weighted tardiness and earliness problems
• A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem

zbMATH Keywords

schedulingsingle machineearlinessnumber of tardy jobsdual criteria

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Complexity of single machine, multi-criteria scheduling problems
• Complexity of single machine hierarchical scheduling: A survey
• Scheduling to minimize maximum earliness and number of tardy jobs where machine idle time is allowed
• A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
• Sequencing with Earliness and Tardiness Penalties: A Review
• Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties
• Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due dates
• Multiple and bicriteria scheduling: A literature survey
• Single machine scheduling to minimize weighted earliness subject to no tardy jobs
• Using genetic algorithms for single-machine bicriteria scheduling problems
• A simulated annealing approach to bicriteria scheduling problems on a single machine
• Algorithm for minimizing weighted earliness penalty in single-machine problem
• Stochastic scheduling on parallel machines subject to random breakdowns to minimize expected costs for earliness and tardy jobs
• Title not available (Why is that?)
• Single machine scheduling to minimize weighted earliness subject to maximum tardiness
• A decision theory based scheduling procedure for single-machine weighted earliness and tardiness problems
• A heuristic for single machine scheduling with early and tardy costs
• Minimizing earliness and tardiness penalties in a single-machine problem with a common due date

Cited In (18)

• Single machine scheduling to minimize weighted earliness subject to no tardy jobs
• Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem with availability constraint
• A note on lot scheduling on a single machine to minimize maximum weighted tardiness
• Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem
• A bi-criterion approach to minimizing inventory costs on a single machine when early shipments are forbidden
• Minimizing total earliness and tardiness on a single machine using a hybrid heuristic
• Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due dates
• Lot scheduling on a single machine to minimize the (weighted) number of tardy orders
• A no-delay single machine scheduling problem to minimize total weighted early and late work
• An exact algorithm for the bi-objective timing problem
• A meta-heuristic to solve the just-in-time job-shop scheduling problem
• A survey of single machine scheduling to minimize weighted number of tardy jobs
• A survey on scheduling problems with due windows
• A multi-objective optimization for preemptive identical parallel machines scheduling problem
• A hybrid meta-heuristic algorithm to minimize the number of tardy jobs in a dynamic two-machine flow shop problem
• Single-machine scheduling with autonomous and induced learning to minimize total weighted number of tardy jobs
• Algorithm for minimizing weighted earliness penalty in single-machine problem
• Scheduling with time-of-use costs

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

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