Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Khouja, Moutaz | Michalewicz, Zbigniew | Vijayaragavan, Poorani
Affiliations: Information and Operations Management Department, University of North Carolina at Charlotte, Charlotte, NC 28223, USA email: [email protected] | Department of Computer Science, University of North Carolina at Charlotte, Charlotte, NC 28223, USA email: [email protected] | Charlotte-Mecklenburg Police Department, 601 E. Trade Street, Charlotte, NC 28202, USA email: [email protected]
Note: [] Address for correspondence: Information and Operations Management Department, University of North Carolina at Charlotte, Charlotte, NC 28223, USA.
Note: [] Address for correspondence: Department of Computer Science, University of North Carolina at Charlotte, Charlotte, NC 28223, USA.
Note: [] Address for correspondence: Charlotte-Mecklenburg Police Department, 601 E. Trade Street, Charlotte, NC 28202, USA.
Abstract: The economic lot and delivery scheduling problem (ELDSP) involves a supply chain consisting of a supplier and an assembly facility, where direct shipments are made from one to the other. The supplier produces multiple components on a single machine or a production line. The assembly facility uses these components at a constant rate. The supplier incurs a sequence-independent setup cost and setup time each time the production line is changed over from one component to another. On the other hand, setup costs and times for the assembly facility are negligible. There is also a fixed charge for each delivery. The problem is to find a “just-in-time” schedule in which one production run of each component and a subsequent delivery of these components to the assembly facility occur in each cycle. The objective is to find the best sequence and cycle duration that minimizes the average cost per unit time of transportation, inventory at both the supplier and the assembly facility, and setup costs at the supplier. In this paper we investigate the usefulness of an evolutionary algorithm for solving this economic lot and delivery scheduling problem.
Keywords: heuristic search, evolutionary algorithms, scheduling, economic lot scheduling and delivery
DOI: 10.3233/FI-1998-35123407
Journal: Fundamenta Informaticae, vol. 35, no. 1-4, pp. 113-123, 1998
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
[email protected]
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office [email protected]
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
如果您在出版方面需要帮助或有任何建, 件至: [email protected]