SCHEDULING OF N TASKSON M MACHINES WITH REACHING THE OBJECTIVE OF MINIMIZING MAKESPAN

Olga Ioana Amariei and Codruta Oana Hamat
Additional contact information
Olga Ioana Amariei: EFTIMIE MURGU UNIVERSITY OF RESITA
Codruta Oana Hamat: EFTIMIE MURGU UNIVERSITY OF RESITA

Annals - Economy Series, 2017, vol. 6, 147-156

Abstract: The present article has the purpose of establishing the launching order in production of n tasks, which are processed in a production cell, having different succesions of execution of operations on m machines, with reaching the main objective of minimizing makespan. It started from a case study in which we wanted to develop an own methodology of design of lower rank production systems, using several softwares, but because of it’s complexity, the study is truncated, being the subject of several specialized articles.

Keywords: processing time; jobs; scheduling; makespan; dispatching rules; Gantt chart; Lekin (search for similar items in EconPapers)
Date: 2017
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.utgjiu.ro/revista/ec/pdf/2017-06/16_Amariei.pdf (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:cbu:jrnlec:y:2017:v:6:p:147-156

Access Statistics for this article

More articles in Annals - Economy Series from Constantin Brancusi University, Faculty of Economics Contact information at EDIRC.
Bibliographic data for series maintained by Ecobici Nicolae ( this e-mail address is bad, please contact ).