Scheduling assemble-to-order systems with multiple cells to minimize costs and tardy deliveries
•Research addresses scheduling of customer orders in assembly cells.•Orders have a due date and a specific delivery location.•Cells are located in different geographical locations.•Two objectives are considered: production costs and percent on time.•Heuristics are proposed and examined. Responsive a...
Saved in:
Published in | Computers & industrial engineering Vol. 115; pp. 290 - 303 |
---|---|
Main Authors | , , , |
Format | Journal Article |
Language | English |
Published |
Elsevier Ltd
01.01.2018
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | •Research addresses scheduling of customer orders in assembly cells.•Orders have a due date and a specific delivery location.•Cells are located in different geographical locations.•Two objectives are considered: production costs and percent on time.•Heuristics are proposed and examined.
Responsive assemble-to-order supply chains demand efficient coordination between production and distribution functions. This paper investigates the case of customer orders assigned to configuration cells located in different geographical regions. Complete orders are directly shipped from the cells to customers located in distinct locations. The objective is to minimize the total cost of production and transportation, and the percentage of tardy deliveries simultaneously. The problem is formulated as a bi-objective optimization problem. Four heuristics are developed for generating a set of Pareto solutions. Extensive experiments ranging from small to large-scale instances are performed. Results show the heuristics generate good, feasible non-dominant solutions, which are especially critical for decision makers. Our results also demonstrate that there is no clear dominant heuristic and that relative heuristic performance is dependent on problem size. Sensitivity analysis of critical parameters reveals additional insights. |
---|---|
ISSN: | 0360-8352 1879-0550 |
DOI: | 10.1016/j.cie.2017.11.012 |