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

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

freely available

Full text |

More access options

Check Google Scholar

In German libraries (KVK)

Which error do you want to report?

Report: URL of this record is broken

Please note: Sometimes more than one URL is available for a resource. Please click on "More Options" to display these URLs

Report: Addition of an URL to that resource

Please note: Sometimes more than one URL is available for a resource. Please click on "More Options" to display these URLs

Report: The language(s) of that resource is/are…

Please note: Required language not in the list? Please use comment field

Report: Addition of an identifier to that resource

Report: report typo

Report: Add statement

Report: Add keywords

Please use the commentary box to describe other errors

Would you like to receive a feedback?

Commentary

Please type the code from the image

For general questions please use this address.

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

A service of the