This file is part of IDEAS, which uses RePEc data


[ Papers | Articles | Software | Books | Chapters | Authors | Institutions | JEL Classification | NEP reports | Search | New papers by email | Author registration | Rankings | Volunteers | FAQ | Blog | Help! ]

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

Author info | Abstract | Publisher info | Download info | Related research | Statistics
Author Info
Susana Fernandes
Helena Ramalhinho-Lourenço ()
Abstract

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.

Download Info
To download:

If you experience problems downloading a file, check if you have the proper application to view it first. Information about this may be contained in the File-Format links below. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

File URL: http://www.econ.upf.edu/docs/papers/downloads/1050.pdf
File Format: application/pdf
File Function: Whole Paper
Download Restriction: no

Publisher Info
Paper provided by Department of Economics and Business, Universitat Pompeu Fabra in its series Economics Working Papers with number 1050.

Download reference. The following formats are available: HTML (with abstract), plain text (with abstract), BibTeX, RIS (EndNote, RefMan, ProCite), ReDIF
Length:
Date of creation: Jan 2007
Date of revision:
Handle: RePEc:upf:upfgen:1050

Contact details of provider:
Web page: http://www.econ.upf.edu/

For technical questions regarding this item, or to correct its listing, contact: ().

Related research
Keywords: Job-shop scheduling; hybrid metaheuristic; optimised search heuristics; GRASP; exact methods;

Find related papers by JEL classification:
C61 - Mathematical and Quantitative Methods - - Mathematical Methods and Programming - - - Optimization Techniques; Programming Models; Dynamic Analysis
M11 - Business Administration and Business Economics; Marketing; Accounting - - Business Administration - - - Production Management

This paper has been announced in the following NEP Reports:

References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
  1. Taillard, E., 1993. "Benchmarks for basic scheduling problems," European Journal of Operational Research, Elsevier, vol. 64(2), pages 278-285, January. [Downloadable!] (restricted)
  2. Carlier, Jacques, 1982. "The one-machine sequencing problem," European Journal of Operational Research, Elsevier, vol. 11(1), pages 42-47, September. [Downloadable!] (restricted)
  3. Lourenco, Helena Ramalhinho, 1995. "Job-shop scheduling: Computational study of local search and large-step optimization methods," European Journal of Operational Research, Elsevier, vol. 83(2), pages 347-364, June. [Downloadable!] (restricted)
  4. Jain, A. S. & Meeran, S., 1999. "Deterministic job-shop scheduling: Past, present and future," European Journal of Operational Research, Elsevier, vol. 113(2), pages 390-434, March. [Downloadable!] (restricted)
Full references

Statistics
Access and download statistics

Did you know? The RePEc project started in 1997. Its precursor, NetEc, dates back to 1993.

This page was last updated on 2009-11-27.

This information is provided to you by IDEAS at the Department of Economics, College of Liberal Arts and Sciences, University of Connecticut using RePEc data on a server sponsored by the Society for Economic Dynamics.