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

makespanpreventive maintenancerelease datescheduling

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) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59)

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

• 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
• scientific article; zbMATH DE number 1389747 (Why is no real title available?)
• 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

(20)

• A novel integrated condition-based maintenance and stochastic flexible job shop scheduling problem: simulation-based optimization approach
• Single-machine scheduling with maintenance activities and rejection
• Developing a flexible manufacturing control system considering mixed uncertain predictive maintenance model: a 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
• Minimizing the sum of completion times on a single machine with health index and flexible maintenance operations
• The parallel AGV scheduling problem with battery constraints: a new formulation and a matheuristic approach
• Minimizing total completion time on a single machine with a flexible maintenance activity
• Scheduling identical serial-batching machines in the engine manufacturing supply chain by an integrated variable neighborhood search Algorithm
• Solving the single-machine scheduling problem with periodical resource constraints
• Smart automated guided vehicle scheduling with flexible battery management: a new formulation and an exact approach
• The single-machine preemptive or resumable scheduling with maintenance intervals
• Non-resumable scheduling on a single bounded parallel-batch machine with flexible maintenance
• Single machine scheduling with maintenance and position-based job eligibility constraints for battery manufacturing
• Q-learning-driven multi-population cooperative evolutionary algorithm with local search for scheduling of network-shared manufacturing resources
• Minimizing the expected cybersecurity loss in a software supply chain through scheduling scanning jobs
• Scheduling maintenance activities subject to continuous stochastic job-dependent machine deterioration
• Integrating maintenance and scheduling decisions in single-machine systems: insights from a systematic and bibliometric review
• Adaptive job shop scheduling via reinforcement learning-guided genetic algorithms with behavioral transparency
• Minimizing the makespan in a single machine scheduling problems with flexible and periodic maintenance

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)