Scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan

This study addresses a single machine scheduling problem with periodic maintenance, where the machine is assumed to be stopped periodically for maintenance for a constant time w during the scheduling period. Meanwhile, the maintenance period [ u, v] is assumed to have been previously arranged and th...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	European journal of operational research Ročník 190; číslo 1; s. 90 - 102
Hlavní autor:	Chen, Jen-Shiang
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Amsterdam Elsevier B.V 01.10.2008 Elsevier Elsevier Sequoia S.A
Edice:	European Journal of Operational Research
Témata:	Applied sciences Availability constraints Exact sciences and technology Heuristic Integer programming Inventory control, production control. Distribution Job shops Maintenance Mathematical programming Operational research and scientific management Operational research. Management science Production scheduling Repair & maintenance Scheduling Scheduling, sequencing Single machine Studies Integer programming Scheduling Maintenance Availability constraints Single machine Heuristic Availability Task scheduling Mixed integer programming Makespan Modeling Workload Mixed model Heuristic method Time constant
ISSN:	0377-2217, 1872-6860
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!