A Simple Optimised Search Heuristic for the Job-Shop Scheduling Problem

This paper presents a simple Optimised Search Heuristic for the Job Shop Scheduling problem that combines a GRASP heuristic with a branch-and-bound algorithm. The proposed method is compared with similar approaches and leads to better results in terms of solution quality and computing times

MoreLess

Year of publication:	[2007]
Authors:	Fernandes, Susana
Other Persons:	Ramalhinho Dias Lourenço, Helena (contributor)
Publisher:	[2007]: [S.l.] : SSRN
Subject:	Theorie \| Theory \| Heuristik \| Heuristics \| Scheduling-Verfahren \| Scheduling problem \| Produktionssteuerung \| Production control

freely available

Full text |

More access options

Check Google Scholar

In German libraries (KVK)

I need help

Extent:	1 Online-Ressource (28 p)
Series:	Lecture Notes in Computer Science (Book Series) ; Vol. 4446, 2007
Type of publication:	Book / Working Paper
Language:	English
Notes:	In: Lecture Notes in Computer Science (Book Series), Vol. 4446, 2007
Classification:	C61 - Optimization Techniques; Programming Models; Dynamic Analysis ; M11 - Production Management
Source:	ECONIS - Online Catalogue of the ZBW

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