O problema do seqüenciamento da produção em uma indústria química: avaliação de uma aplicação real

The present research discusses an application of production management relevant to the production planning of a chemical firm which produces goods according to orders placed by clients. A number of difficulties have precluded the direct use of the ELSP type of model. This paper describes the challenges met and discusses the options adopted relative to setup costs, production sequencing, and the production of small orders, which require a short production time but long setups. The study includes the development of a production sequence methodology based on the traveling salesman problem, followed by an algorithm to reduce earliness and tardiness penalties.

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

[2]  J. R. Brown,et al.  A two-stage traveling salesman procedure for the single machine sequence-dependent scheduling problem , 1995 .

[3]  Edward K. Baker,et al.  Technical Note - An Exact Algorithm for the Time-Constrained Traveling Salesman Problem , 1983, Oper. Res..

[4]  Hamilton Carlos Massaro Santos,et al.  Meta-heurística para programação da produção com tempos de preparação dependentes da seqüência , 1995 .

[5]  Seiichi Fujita,et al.  AN APPLIED PROCEDURE FOR DETERMINING THE ECONOMIC LOT SIZES OF MULTIPLE PRODUCTS , 1980 .

[6]  Fayez Fouad Boctor,et al.  The Two-Product, Single-Machine, Static Demand, Infinite Horizon Lot Scheduling Problem , 1982 .

[7]  G. Leong,et al.  Single machine scheduling: A comparison of two solution procedures , 1987 .

[8]  Gary D. Scudder,et al.  Sequencing with Earliness and Tardiness Penalties: A Review , 1990, Oper. Res..

[9]  Thomas E. Morton,et al.  The single machine early/tardy problem , 1989 .

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

[11]  Costas P. Pappis,et al.  Single Machine Scheduling with Flow Allowances , 1996 .

[12]  A. M. A. Hariri,et al.  Single machine scheduling with deadlines to minimize the weighted number of tardy jobs , 1994 .

[13]  Ching-Jong Liao,et al.  Sequencing with setup time and order tardiness trade‐offs , 1996 .

[14]  Candace Arai Yano,et al.  Minimizing mean tardiness and earliness in single machine scheduling problems with unequal due-dates , 1994 .

[15]  Jose A. Ventura,et al.  Single Machine Scheduling with a Common Delivery Window , 1996 .

[16]  C. J. Liao,et al.  Sequencing heuristics for dependent setups in a continuous process industry , 1996 .