Single-machine scheduling with workload-dependent maintenance duration to minimize maximum lateness

DOI10.1155/2015/732437zbMath1394.90311OpenAlexW1558385386WikidataQ59119076 ScholiaQ59119076MaRDI QIDQ1666458

Dehua Xu, Ting Wang

Publication date: 27 August 2018

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2015/732437

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Unnamed Item
• Minimizing maximum lateness of jobs with naturally bounded job data on a single machine in polynomial time
• The strong NP-hardness of the maximum lateness minimization scheduling problem with the processing-time based aging effect
• Minimizing the maximum lateness in a single-machine scheduling problem with the normal time-dependent and job-dependent learning effect
• Rescheduling for machine disruption to minimize makespan and maximum lateness
• Single machine batch scheduling to minimize the sum of total flow time and batch delivery cost with an unavailability interval
• Single-machine scheduling with periodic maintenance to minimize makespan
• Mathematical programming models for competitive two-agent single-machine scheduling with flexible periodic maintenance activities
• Makespan minimization for two parallel machines scheduling with a periodic availability constraint: mathematical programming model, average-case analysis, and anomalies
• Single-machine scheduling and slack due-date assignment with aging effect and deteriorating maintenance
• Approximation Algorithms for Scheduling with a Variable Machine Maintenance
• Scheduling

This page was built for publication: Single-machine scheduling with workload-dependent maintenance duration to minimize maximum lateness