Minimizing total flow time in the single-machine scheduling problem with periodic maintenance

From MaRDI portal
Revision as of 16:10, 4 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3378821

DOI10.1057/PALGRAVE.JORS.2601998zbMath1086.90020OpenAlexW1980015951MaRDI QIDQ3378821

No author found.

Publication date: 4 April 2006

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2601998




Related Items (23)

Minimising total flow-time on two parallel machines with planned downtimes and resumable jobsHuman resources scheduling to improve the product quality according to exhaustion limitProduction-driven opportunistic maintenance for batch production based on MAM-APB schedulingApproximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability intervalMathematical programming models for competitive two-agent single-machine scheduling with flexible periodic maintenance activitiesScheduling two parallel machines with machine-dependent availabilitiesA note on worst-case performance of heuristics for maintenance scheduling problemsSupply chain scheduling problem in the hospital with periodic working time on a single machineScheduling with day shifts and breaksSingle-machine Scheduling Problems with Aging/Deteriorating Effect under an Optional Maintenance Activity ConsiderationFast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release datesSINGLE MACHINE SCHEDULING WITH FORBIDDEN INTERVALS AND JOB DELIVERY TIMESSingle-machine scheduling with maintenance activities and rejectionSingle-machine scheduling with maintenance in a manufacturing systemExact solution of the single-machine scheduling problem with periodic maintenances and sequence-dependent setup timesMinimizing the number of tardy jobs in a single-machine scheduling problem with periodic maintenanceMinimizing the makespan in a single machine scheduling problems with flexible and periodic maintenanceA single-machine scheduling problem with maintenance activities to minimize makespanSingle machine scheduling with preventive maintenancesSingle machine batch scheduling to minimize the sum of total flow time and batch delivery cost with an unavailability intervalMakespan minimization for two parallel machines scheduling with a periodic availability constraint: mathematical programming model, average-case analysis, and anomaliesHeuristics for the single machine weighted sum of completion times scheduling problem with periodic maintenanceScheduling a maintenance activity to minimize total weighted completion-time







This page was built for publication: Minimizing total flow time in the single-machine scheduling problem with periodic maintenance