Integrative Cycle Scheduling Approach for a Capacitated Flexible Assembly System

This study revisits the traditional single stage, multi-item, capacitated lot-sizing problem (CLSP) with a new integrative focus on problem structuring. Unlike past research, we develop integrative cycle scheduling approaches which simultaneously address lot-sizing, capacity, and sequencing issues. Our purposes are to (1) explore the effect of sequencing on inventory levels, (2) examine the problem of infeasibility in the economic lot scheduling problem (ELSP), and (3) provide a simple methodology of generating low-cost cycle schedules in an environment with discrete shipping, dynamic demands, limited capacity, zero setup cost, and sequence-independent setup times. Our procedures are compared to benchmark cycle scheduling approaches in terms of both inventory cost and computation time under different demand scenarios, using the operating data from a flexible assembly system (FAS) at the Ford Motor Company's Sandusky, Ohio plant.

[1]  Loren Paul Rees,et al.  Solving the Economic Lot‐Scheduling Problem Using the Method of Prime Subperiods , 1989 .

[2]  W. Hsu.  On the General Feasibility Test of Scheduling Lot Sizes for Several Products on One Machine , 1983 .

[3]  S. Selcuk Erenguc,et al.  On the Joint Lot-Sizing Problem with Zero Setup Costs , 1989 .

[4]  Samuel G. Davis.  Scheduling Economic Lot Size Production Runs , 1990 .

[5]  G. Bitran,et al.  Computational Complexity of the Capacitated Lot Size Problem , 1982 .

[6]  Jack D. Rogers.  A Computational Approach to the Economic Lot Scheduling Problem , 1958 .

[7]  Peter A. Pinto,et al.  Concepts, Theory, and Techniques A JOINT LOT-SIZING RULE FOR FIXED LABOR-COST SITUATIONS , 1986 .

[8]  S. Elmaghraby.  The Economic Lot Scheduling Problem (ELSP): Review and Extensions , 1978 .

[9]  L. V. Wassenhove,et al.  Some extensions of the discrete lotsizing and scheduling problem , 1991 .

[10]  Earl E. Bomberger,et al.  A Dynamic Programming Approach to a Lot Size Scheduling Problem , 1966 .

[11]  William J. Zimmer,et al.  Tables of Sample Sizes in the Analysis of Variance , 1970 .

[12]  Stanley Zionts,et al.  Multi-Item Scheduling by Benders' Decomposition , 1987 .

[13]  Alan S. Manne,et al.  Programming of Economic Lot Sizes , 1958 .

[14]  William W. Trigeiro,et al.  Capacitated lot sizing with setup times , 1989 .

[15]  B. P. Dzielinski,et al.  Optimal Programming of Lot Sizes, Inventory and Labor Allocations , 1965 .

[16]  Leon S. Lasdon,et al.  An Efficient Algorithm for Multi-Item Scheduling , 1971, Oper. Res..

[17]  Luk N. Van Wassenhove,et al.  Multi-Item Single-Level Capacitated Dynamic Lot-Sizing Heuristics: A General Review , 1988 .

[18]  E. Newson.  Multi-Item Lot Size Scheduling by Heuristic Part I: With Fixed Resources , 1975 .

[19]  Lloyd A. Swanson,et al.  A lot sizing and sequencing algorithm for dynamic demands upon a single facility , 1982 .

[20]  L. Ritzman,et al.  A cyclical scheduling heuristic for lot sizing with capacity constraints , 1984 .

[21]  C L Doll,et al.  AN ITERATIVE PROCEDURE FOR THE SINGLE-MACHINE, MULTI-PRODUCT LOT SCHEDULING PROBLEM : A WORKING PAPER , 1973 .

[22]  Y. Sugimori,et al.  Toyota production system and Kanban system Materialization of just-in-time and respect-for-human system , 1977 .

[23]  Vincent A. Mabert,et al.  Cyclical schedules for capacitated lot sizing with dynamic demands , 1991 .