Heuristic Procedures for Minimizing Makespan and the Number of Required Pallets

A heuristic procedure is developed for minimizing makespan in flow-shop scheduling problems. In comparison with current algorithms, our algorithm seems to result in an improved makespan with a small additional computational effort. An algorithm is also developed to minimize the required number of pallets for a given makespan

MoreLess

Year of publication:	[2017]
Authors:	Chu, Chengbin
Other Persons:	Proth, Jean-Marie (contributor) ; Sethi, Suresh (contributor)
Publisher:	[2017]: [S.l.] : SSRN
Subject:	Theorie \| Theory \| Heuristik \| Heuristics \| Scheduling-Verfahren \| Scheduling problem \| Durchlaufzeit \| Lead time

freely available

Full text |

More access options

Check Google Scholar

In German libraries (KVK)

I need help

Extent:	1 Online-Ressource (12 p)
Type of publication:	Book / Working Paper
Language:	English
Notes:	In: European Journal of Operational Research, Vol. 86, No. 3, pp. 491-502, November 1995 Nach Informationen von SSRN wurde die ursprüngliche Fassung des Dokuments November 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/10012746785