SLSP - SIMULTANEOUS LOTSIZING AND SCHEDULING IN A JOB SHOP ENVIRONMENT

Michael Hock
Additional contact information
Michael Hock: TU Bergakademie Freiberg

Polish Journal of Management Studies, 2010, vol. 1, issue 1, 1-172

Abstract: This paper provides an application oriented analysis of a multiple constraint scheduling procedure called SLSP, which is designed to batch and sequence production orders simultaneously. The Simultaneous Lotsizing and Scheduling Procedure (SLSP) is easy to implement in a Shop Floor Control System and leads to good results for finite loading problems. Dependent on the data available and the goal of production control SLSP can be used to minimize production costs or any other objective function, like minimizing the mean flow time or tardiness of the jobs. The approach is primarily based on a combination of regular dispatching rules and local search heuristics, such as Simulated Annealing, Threshold Accepting or Tabu Search. Additionally the procedure contains a special routine to calculate lot sizes using the Aspired Machine Time (AMT) as a control parameter.

Keywords: scheduling; batching; flexible routing; local search algorithms (search for similar items in EconPapers)
JEL-codes: E00 M00 P00 (search for similar items in EconPapers)
Date: 2010
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.pjms.zim.pcz.pl/Conceptual%20approaches ... pany%20logistics.pdf (application/pdf)
http://www.pjms.zim.pcz.pl/slsp---simultaneous-lot ... shop-environment.php (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:pcz:journl:v:1:y:2010:i:1:p:1-172

Access Statistics for this article

More articles in Polish Journal of Management Studies from Czestochowa Technical University, Department of Management Contact information at EDIRC.
Bibliographic data for series maintained by Paula Bajdor ().