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

DOI10.1016/J.EJOR.2008.01.029MaRDI QIDQ2378377zbMATH OpenOpenAlexFDO

Authors Guohua Wan, Benjamin P.-C. Yen

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

dual criteriaearlinessnumber of tardy jobsschedulingsingle machine

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

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

Cites work

• A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
• 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
• A simulated annealing approach to bicriteria scheduling problems on a single machine
• Algorithm for minimizing weighted earliness penalty in single-machine problem
• Complexity of single machine hierarchical scheduling: A survey
• Complexity of single machine, multi-criteria scheduling problems
• scientific article; zbMATH DE number 3430360 (Why is no real title available?)
• Minimizing earliness and tardiness penalties in a single-machine problem with a common due date
• Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due dates
• Multiple and bicriteria scheduling: A literature survey
• Scheduling to minimize maximum earliness and number of tardy jobs where machine idle time is allowed
• Sequencing with Earliness and Tardiness Penalties: A Review
• Single machine scheduling to minimize weighted earliness subject to maximum tardiness
• Single machine scheduling to minimize weighted earliness subject to no tardy jobs
• Stochastic scheduling on parallel machines subject to random breakdowns to minimize expected costs for earliness and tardy jobs
• Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties
• Using genetic algorithms for single-machine bicriteria scheduling problems

Cited in

(27)

• Single machine scheduling to minimize weighted earliness subject to no tardy jobs
• A decision theory based scheduling procedure for single-machine weighted earliness and tardiness problems
• Single machine scheduling to minimize weighted earliness subject to maximum tardiness
• An exact algorithm for the bi-objective timing problem
• A hybrid meta-heuristic algorithm to minimize the number of tardy jobs in a dynamic two-machine flow shop problem
• The single machine weighted mean squared deviation problem
• Scheduling with time-of-use costs
• Heuristic and exact algorithms for the two-machine just in time job shop scheduling problem
• A meta-heuristic to solve the just-in-time job-shop scheduling problem
• Lot scheduling on a single machine to minimize the (weighted) number of tardy orders
• Algorithms for a class of single-machine weighted tardiness and earliness problems
• A multi-objective optimization for preemptive identical parallel machines scheduling problem
• Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem with availability constraint
• Finding Pareto optima for maximum tardiness, maximum earliness and number of tardy jobs
• A survey on scheduling problems with due windows
• Just-in-time single-batch-processing machine scheduling
• Ant colony systems for the single-machine total weighted earliness tardiness scheduling problem
• A moving block heuristic to minimise earliness and tardiness costs on parallel machines
• A survey of single machine scheduling to minimize weighted number of tardy jobs
• Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due dates
• A bi-criterion approach to minimizing inventory costs on a single machine when early shipments are forbidden
• A no-delay single machine scheduling problem to minimize total weighted early and late work
• Single-machine scheduling with autonomous and induced learning to minimize total weighted number of tardy jobs
• 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
• Algorithm for minimizing weighted earliness penalty in single-machine problem
• Minimizing total earliness and tardiness on a single machine using a hybrid heuristic

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)