Minimizing the makespan on a single machine with flexible maintenances and jobs' release dates

DOI10.1016/J.COR.2016.11.008MaRDI QIDQ1652182zbMATH OpenOpenAlexFDO

Authors Wei-Wei Cui, Zhiqiang Lu

Publication date 11 July 2018

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2016.11.008

zbMATH Keywords

schedulingmakespanrelease datepreventive maintenance

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Mixed integer programming (90C11)

Recommendations

• Minimizing the makespan in a single machine scheduling problems with flexible and periodic maintenance
• Single-machine scheduling with flexible and periodic maintenance
• Minimizing total completion time on a single machine with a flexible maintenance activity
• Scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan
• Single machine scheduling with preventive maintenances

Cites work

• scientific article; zbMATH DE number 1389747 (Why is no real title available?)
• A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints
• An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints
• Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates
• Improved approximation for non-preemptive single machine flow-time scheduling with an availability constraint
• Machine scheduling with an availability constraint
• Machine scheduling with availability constraints
• Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem with availability constraint
• Minimizing the makespan in a single machine scheduling problems with flexible and periodic maintenance
• Minimizing the number of tardy jobs in a single-machine scheduling problem with periodic maintenance
• Minimizing total completion time on a single machine with a flexible maintenance activity
• Scheduling a maintenance activity to minimize total weighted completion-time
• Scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan
• Scheduling the maintenance on a single machine
• Scheduling with limited machine availability
• Single machine flow-time scheduling with a single breakdown
• Single machine flow-time scheduling with scheduled maintenance
• Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times
• Single-machine scheduling with flexible and periodic maintenance
• Single-machine scheduling with periodic maintenance and nonresumable jobs.
• Single-machine scheduling with periodic maintenance to minimize makespan
• Worst-case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period

Cited in

(10)

• A novel integrated condition-based maintenance and stochastic flexible job shop scheduling problem: simulation-based optimization approach
• Single-machine common due date total earliness/tardiness scheduling with machine unavailability
• Equivalence of some different maintenance activities in single-machine scheduling
• The parallel AGV scheduling problem with battery constraints: a new formulation and a matheuristic approach
• Developing a flexible manufacturing control system considering mixed uncertain predictive maintenance model: a simulation-based optimization approach
• Minimizing the sum of completion times on a single machine with health index and flexible maintenance operations
• Minimizing total completion time on a single machine with a flexible maintenance activity
• Minimizing the makespan in a single machine scheduling problems with flexible and periodic maintenance
• Single-machine scheduling with maintenance activities and rejection
• Scheduling identical serial-batching machines in the engine manufacturing supply chain by an integrated variable neighborhood search Algorithm

This page was built for publication: Minimizing the makespan on a single machine with flexible maintenances and jobs' release dates

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