Single-machine common due date total earliness/tardiness scheduling with machine unavailability

DOI10.1007/S10951-018-0585-XMaRDI QIDQ2286433zbMATH OpenOpenAlexFDO

Authors Kerem Bülbül, S. Kedad-Sidhoum, Halil Şen

Publication date 22 January 2020

Published in Journal of Scheduling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10951-018-0585-x

zbMATH Keywords

\( \mathcal{NP} \)-completecommon due datedynamic programmingearliness/tardinessmachine unavailabilitymaintenancenon-resumableresumablesemi-resumablesingle-machineunrestrictive

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Recommendations

• Minimizing total earliness and tardiness for common due date single-machine scheduling with an unavailability interval
• Single machine scheduling with semi-resumable machine availability constraints
• Two-machine flowshop scheduling with availability constraints
• New single machine and job-shop scheduling problems with availability constraints
• Minimizing total weighted late work on a single-machine with non-availability intervals

Cites work

• A binary multiple knapsack model for single machine scheduling with machine unavailability
• A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints
• An improved dynamic programming algorithm for the single-machine mean absolute deviation problem with a restrictive common due date
• Approximation schemes for single-machine scheduling with a fixed maintenance activity to minimize the total amount of late work
• Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date
• scientific article; zbMATH DE number 4059106 (Why is no real title available?)
• scientific article; zbMATH DE number 1389747 (Why is no real title available?)
• Machine scheduling with an availability constraint
• Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem with availability constraint
• Minimizing mean absolute deviation of completion times about a common due date
• Minimizing the average deviation of job completion times about a common due date
• Minimizing the makespan in a single machine scheduling problems with flexible and periodic maintenance
• Minimizing the makespan on a single machine with flexible maintenances and jobs' release dates
• Minimizing the number of tardy jobs in a single-machine scheduling problem with periodic maintenance
• Minimizing the weighted sum of maximum earliness and maximum tardiness costs on a single machine with periodic preventive maintenance
• On scheduling with ready-times, due-dates and vacations
• One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
• Preemptive scheduling with availability constraints to minimize total weighted completion times
• Rescheduling on identical parallel machines with machine disruptions to minimize total completion time
• Scheduling around a small common due date
• Scheduling position-dependent maintenance operations
• Scheduling with limited machine availability
• Sequencing with Earliness and Tardiness Penalties: A Review
• Single machine flow-time scheduling with a single breakdown
• Single Machine Scheduling Problems with General Breakdowns, Earliness and Tardiness Costs
• Single machine scheduling with small operator-non-availability periods
• Single- and multiple-processor models for minimizing completion time variance
• Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times
• Single-machine scheduling with periodic maintenance to minimize makespan
• Stochastic Scheduling with Variable Profile and Precedence Constraints
• Two-machine flowshop scheduling with availability constraints

Cited in

(9)

• Minimizing total earliness and tardiness for common due date single-machine scheduling with an unavailability interval
• A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems
• Minimizing total weighted late work on a single-machine with non-availability intervals
• A note on the single machine CON and CONW problems with lot scheduling
• An exact quadratic programming approach based on convex reformulation for seru scheduling problems
• Equitable scheduling on a single machine
• Minimizing tardiness scheduling measures with generalized due-dates and a maintenance activity
• Integrating maintenance and scheduling decisions in single-machine systems: insights from a systematic and bibliometric review
• New single machine and job-shop scheduling problems with availability constraints

This page was built for publication: Single-machine common due date total earliness/tardiness scheduling with machine unavailability

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