Deterministic scheduling in computing and manufacturing systems: a survey of models and algorithms

Tzafestas, S; Triantafyllakis, A

dc.contributor.author	Tzafestas, S	en
dc.contributor.author	Triantafyllakis, A	en
dc.date.accessioned	2014-03-01T01:09:21Z
dc.date.available	2014-03-01T01:09:21Z
dc.date.issued	1993	en
dc.identifier.issn	0378-4754	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/10927
dc.relation.uri	http://www.scopus.com/inward/record.url?eid=2-s2.0-0027695322&partnerID=40&md5=4b0e3dda6e40797b78c558d3f8054f9e	en
dc.subject	Manufacturing System	en
dc.subject.classification	Computer Science, Interdisciplinary Applications	en
dc.subject.classification	Computer Science, Software Engineering	en
dc.subject.classification	Mathematics, Applied	en
dc.subject.other	Artificial intelligence	en
dc.subject.other	Optimization	en
dc.subject.other	Parallel processing systems	en
dc.subject.other	Time and motion study	en
dc.subject.other	Deterministic scheduling	en
dc.subject.other	Makespan minimization	en
dc.subject.other	Maximum lateness minimization	en
dc.subject.other	Optimality criterion	en
dc.subject.other	Parallel processor scheduling	en
dc.subject.other	Scheduling	en
dc.title	Deterministic scheduling in computing and manufacturing systems: a survey of models and algorithms	en
heal.type	journalArticle	en
heal.language	English	en
heal.publicationDate	1993	en
heal.abstract	Scheduling problems deal with the assignment of tasks, over time, to processors, so as to optimize a performance criterion, while satisfying a set of given constraints. In this paper a comprehensive survey of the major results in this area is presented. Specifically, a unified formulation of deterministic scheduling models (problems) is provided on the basis of the three standard data fields, viz. the task set, the processor set, and the optimality criterion set. Some particular practical interpretations of these problems are briefly outlined, and a general discussion on their solution approaches is included. The main body of the paper examines the classes of ""parallel processor scheduling"" and ""resource constrained scheduling"" problems. In both classes the following cases are considered: (i) makespan minimization, (ii) maximum lateness minimization, (iii) mean and mean weighted flow time minimization, and (iv) maximum weighted lateness minimization. The paper ends with a discussion of some problems of the sequencing, open-shop, job-shop and flow-shop types, and with some remarks on the potentiality of artificial intelligence and expert systems to solve difficult scheduling problems. © 1993.	en
heal.publisher	ELSEVIER SCIENCE BV	en
heal.journalName	Mathematics and Computers in Simulation	en
dc.identifier.isi	ISI:A1993MH49800002	en
dc.identifier.volume	35	en
dc.identifier.issue	5	en
dc.identifier.spage	397	en
dc.identifier.epage	434	en