An Efficient Algorithm for a Job Shop Problem

We study the problem of minimizing makespan in a two-machine job shop with unit processing time operations. An efficient algorithm with respect to a succinct encoding of the problem instances is proposed. The algorithm is an improvement of earlier algorithms proposed for the problem by Brucker [ 1,2], Hefetz and Adiri [7], and Timkovskiy [15]. The idea behind the algorithm has the potential of extension to job shops with parallel machines

MoreLess

Year of publication:	[2017]
Authors:	Kubiak, Wieslaw
Other Persons:	Sethi, Suresh (contributor) ; Sriskandarajah, Chelliah (contributor)
Publisher:	[2017]: [S.l.] : SSRN
Subject:	Theorie \| Theory \| Scheduling-Verfahren \| Scheduling problem \| Algorithmus \| Algorithm \| Mathematische Optimierung \| Mathematical programming \| Produktionssteuerung \| Production control

freely available

Full text |

More access options

Check Google Scholar

In German libraries (KVK)

I need help

Extent:	1 Online-Ressource (14 p)
Type of publication:	Book / Working Paper
Language:	English
Notes:	In: Annals of Operations Research, Vol. 57, pp. 203-216, 1995 Nach Informationen von SSRN wurde die ursprüngliche Fassung des Dokuments 1995 erstellt
Classification:	M11 - Production Management ; C61 - Optimization Techniques; Programming Models; Dynamic Analysis
Source:	ECONIS - Online Catalogue of the ZBW

Persistent link: https://www.econbiz.de/10012746789