A note on scheduling parallel machines subject to breakdown and repair | Zendy

Leung Joseph Y.T. | Zendy; Pinedo Michael | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Premium

A note on scheduling parallel machines subject to breakdown and repair

Author(s) -

Leung Joseph Y.T.,

Pinedo Michael

Publication year - 2004

Publication title -

naval research logistics (nrl)

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.665

H-Index - 68

eISSN - 1520-6750

pISSN - 0894-069X

DOI - 10.1002/nav.10105

Subject(s) - subject (documents) , computer science , job shop scheduling , scheduling (production processes) , mathematical optimization , parallel computing , operations research , mathematics , schedule , operating system , library science

In this paper we consider n jobs and a number of machines in parallel. The machines are identical and subject to breakdown and repair. The number may therefore vary over time and is at time t equal to m ( t ). Preemptions are allowed. We consider three objectives, namely, the total completion time, ∑ C j , the makespan C max , and the maximum lateness L max . We study the conditions on m ( t ) under which various rules minimize the objective functions under consideration. We analyze cases when the jobs have deadlines to meet and when the jobs are subject to precedence constraints. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here

Accelerating Research