Job-shop scheduling - using component packing and simulated annealing approach

M. F. Hussain, S. B. Joshi

Research output: Contribution to journalArticlepeer-review

5 Scopus citations

Abstract

An algorithm to solve the job-shop scheduling problem based on the component packing principle is presented. This approach uses the principles of finding an efficient packing of components by modelling machines as bins and operations as components. The algorithm is based on adaptive simulated annealing. The proposed neighbourhood generation scheme is problem independent and it provides fast and good solutions. Computational results show that this algorithm performs better than other recent annealing-based approaches.

Original languageEnglish (US)
Pages (from-to)3711-3723
Number of pages13
JournalInternational Journal of Production Research
Volume37
Issue number16
DOIs
StatePublished - Sep 1999

All Science Journal Classification (ASJC) codes

  • Strategy and Management
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering

Fingerprint Dive into the research topics of 'Job-shop scheduling - using component packing and simulated annealing approach'. Together they form a unique fingerprint.

Cite this