Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem with availability constraint

DOI10.1016/j.camwa.2011.09.016zbMath1236.90056OpenAlexW2003964296MaRDI QIDQ2429001

Mohammad Reisi, Ghasem Moslehi, Ehsan Molaee

Publication date: 22 April 2012

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2011.09.016

zbMATH Keywords

schedulingPareto solutionavailability constraintmaximum earlinesstardy jobs

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (3)

Minimizing the makespan on a single machine with flexible maintenances and jobs' release dates ⋮ A binary multiple knapsack model for single machine scheduling with machine unavailability ⋮ Single-machine common due date total earliness/tardiness scheduling with machine unavailability

Cites Work

• Unnamed Item
• Unnamed Item
• Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem
• Single machine flow-time scheduling with scheduled maintenance
• A comparison of lower bounds for the single-machine early/tardy problem
• Minimizing total earliness and tardiness on a single machine using a hybrid heuristic
• Genetic algorithm for bi-criteria single machine scheduling problem of minimizing maximum earliness and number of tardy jobs
• Single machine flow-time scheduling with a single breakdown
• Machine scheduling with availability constraints
• An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints
• Scheduling with limited machine availability
• Improved approximation for non-preemptive single machine flow-time scheduling with an availability constraint
• Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs
• Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times
• Single machine scheduling with family setups to minimize total earliness and tardiness
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs

This page was built for publication: Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem with availability constraint