Problema de programação da produção um esquema de classificação

Lopez, Oscar Ciro; Barcia, Ricardo M.; Eyada, Osama

doi:10.1590/S0103-65131995000200003

Resumos

Muitas vezes, não é simples encontrar uma classificação exata para os problemas de programação, não somente porque existem diferentes versões para um dado problema, mas, porque vários procedimentos para uma questão particular, são caracterizados por premissas diferentes e limitações de aplicação dos modelos desenvolvidos. O objetivo deste artigo é delinear uma classificação ampla que permita estabelecer o sentido, direção e perspectiva de pesquisas conduzidas na área. O trabalho não tem a intenção de dar um levantamento exaustivo da literatura de programação da produção, que pode ser encontrado em vários outros trabalhos de revisão.

Programação; Sequenciamento; Problemas de Produção; Classificação da Produção

It is the purpose of this article to review the various solutions that have been proposed for the production scheduling problem. An attempt is made to give a classification scheme to categorize the existing procedures that allow to point out potential future courses of development. Emphasis is placed on the basic assumptions involved in each production sequencing problem rather than to approaches used to obtain a solution.

Scheduling; Sequencing; Production Problems; Production Classification

Problema de programação da produção um esquema de classificação

Oscar Ciro Lopez, Dr.^I; Prof.Ricardo M. Barcia, Ph.D^I; Prof. Osama Eyada, Ph.D^II

^IDepartamento de Engenharia de Produção e Sistemas. Programa de Pós-Graduação em Engenharia de Produção. Cx.P. 476 Tel: (048) 2341255 / 2319596. Universidade Federal de Santa Catarina, CEP 88040-900 - Florianópolis - SC

^IIDepartment of Industrial and System Engineering. Virginia Polytechnic Institute and State University. Blacksburg, Virginia 24061-0118 - USA

RESUMO

Muitas vezes, não é simples encontrar uma classificação exata para os problemas de programação, não somente porque existem diferentes versões para um dado problema, mas, porque vários procedimentos para uma questão particular, são caracterizados por premissas diferentes e limitações de aplicação dos modelos desenvolvidos. O objetivo deste artigo é delinear uma classificação ampla que permita estabelecer o sentido, direção e perspectiva de pesquisas conduzidas na área. O trabalho não tem a intenção de dar um levantamento exaustivo da literatura de programação da produção, que pode ser encontrado em vários outros trabalhos de revisão.

Palavras Chave: Programação, Sequenciamento, Problemas de Produção, Classificação da Produção

ABSTRACT

It is the purpose of this article to review the various solutions that have been proposed for the production scheduling problem. An attempt is made to give a classification scheme to categorize the existing procedures that allow to point out potential future courses of development. Emphasis is placed on the basic assumptions involved in each production sequencing problem rather than to approaches used to obtain a solution.

Key Words: Scheduling, Sequencing, Production Problems, Production Classification

Texto completo disponível apenas em PDF.

Full text available only in PDF format.

ADAMS, J., BALAS, E. e ZAWACK, D. The Shifting Bottleneck Procedure For Job Shop Scheduling. Management Science. v.34, n.3, p. 391-401. 1988.
ADIRI, I., FROSTIG, E. e RINNOOY KAN, A.H.G. Scheduling On A Single Machine With A Single Breakdown To Minimize Stochastically The Number Of Tardy Jobs. Naval Research Logistics. v. 38, p. 261-271. 1991.
ALIDAEE, B. A Heuristic Solution Procedure To Minimize Makespan On A Single Machine With Non-Linear Cost Functions. Journal of Operational Research Society. v. 41, n.11, p. 1065-1068. 1990.
ALIDAEE, B. e AHMADIAN, A. Two Parallel Machine Sequencing Problems Involving Controllable Job Processing Times. European Journal of Operational Research. v. 70, p. 335-341.1993.
APPLEGATE, D. e COOK, W. A Computational Study Of The Job-Shop Scheduling Problem. ORSA Journal of Computation. v. 3, p. 149-156. 1990.
ARKIN, E.M. e ROUNDY, R.O. Weighted-Tardiness Scheduling On Parallel Machines With Proportional Weights. Operations Research. v. 39, n. 1, p. 64 - 81. 1991.
BAKER, K. e SCUDDER, G.D. Sequencing With Earliness And Tardiness Penalties: A Review. Operations Research. v. 38, p. 22-36. 1990.
BAKSHI, M.S. e ARORA, S.R. The Sequencing Problem. Management Science. v. 16, p. B247-B263. 1969.
BARNES, J.W. e LAGUNA. M. A Tabu Search Experience In Production Scheduling. An s of Operations Research. v. 41, p. 141-156. 1993.
BELLMAN, R., ESOGBUE, A.O. e NABESHIMA, I. Mathematical Aspects Of Scheduling And Applications. Pergamon Press. 1982.
BIEGEL, J.E. e DAVERN, J.J. Genetic Algorithms And The Job Shop Scheduling. Computers and Industrial Engineering. v. 19, n. 1 e 4, p. 81-91. 1990.
BLOCHER, J.D. e CHAND, S. Scheduling Of Parallel Processors: A Posterior Bound On LPT Sequencing And A Two-Step Algorithm. Naval Research Logistics. v. 38, p. 273-287. 1991.
BUXEY, G. Production Scheduling: Practice And Theory. European Journal of Operational Research. v. 39, p. 17-31. 1989.
CADAMBI, B.V. e SATHE, Y.S. Two-Machine Flowshop Scheduling To Minimize Mean Flow Time. Opsearch. v. 30, n. 1, p. 34-41. 1993.
CAO, J. e BEDWORTH, D.D. Flow Shop Scheduling In Serial Multi-Product Processes With Transfer And Set-Up Times. International Journal of Production Research. v. 30, n. 8, p. 1819-1830. 1992.
CARLIER, J. e PINSON, E. An Algorithm For Solving The Job-Shop Problem. Management Science. v. 35, n. 2, p. 164-176. 1989.
CARRENO, J.J. Economic Lot Scheduling For Multiple Products On Parallel Identical Processors. Management Science. v. 36, n. 3, p. 348-358. 1990.
CHAMBERS, R.J., CARRAWAY, R.L., LOWE, T.J e MORIN, T.L. Dominance And Decomposition Heuristics For Single Machine Scheduling. Operations Research. v. 39, n. 4, p. 639-648. 1991.
CHANDRU, V., LEE, C.-Y. e UZSOY, R. Minimizing Total Completion Time On Batch Processing Machines. International Journal of Production Research. v. 31, n. 9, p. 2097-2121. 1993.
CHRYSSOLOURIS, G., DICKE, K. e LEE, M. On The Resource Allocation Problem. International Journal of Production Research. v.31, n.12, p. 2773-2795. 1992.
CHENG, C. e BULFIN R.L. Complexity Of Single Machine, Multi-Criteria Scheduling Problems. European Journal of Operational Research. v. 70, p. 115-125. 1993.
CHU, C. A Branch-And-Bound Algorithm To Minimize Total Flow Time With Unequal Release Dates. Naval Research Logistics. v. 39, p. 859-875. 1992a.
CHU, C. A Branch-And-Bound Algorithm To Minimize Total Tardiness With Different Release Dates. Naval Research Logistics. v. 39, p. 265-283. 1992.
CHU, C, PORTMANN, M.C. e PROTH, J.M. A Splitting-Up Approach To Simplify Job-Shop Scheduling Problems. International Journal of Production Research. v. 30, n. 4, p. 859-870. 1992.
COFFMAN, JR. E.G. Introduction To Deterministic Scheduling Theory. In: Computer And Job-Shop Scheduling Theory. Coffman, Jr.E.G. John Wiley & Sons. 1976.
DAUZERE-PERES, S. The One-Machine Sequencing Problem With Dependent Jobs. Computer and Industrial Engineering, v. 25, n. 1/44, p. 235-238. 1993.
DAUZERE-PERES, S. e LASSERRE, J-B. An Iterative Procedure For Lot Streaming In Job-Shop Scheduling. Computers and Industrial Engineering. v. 25, n. 1/4, p. 231-234. 1993a.
DAUZERE-PERES, S. e LASSERRE, J-B. A Modified Shifting Bottleneck Procedure For Job-Shop Scheduling. International Journal of Production Research. v. 31, n. 4, p. 923-932. 1993.
DAVIS, J.S. e KANET, J.J. Single-Machine Scheduling With Early And Tardy Completion Costs. Naval Research Logistics. v. 40, p. 85-101. 1993.
DAY, J.E e HOTTENSTEIN, M.P. Review Of Sequencing Research. Naval Research Logistics Quarterly. v. 17, p. 11-40. 1970,
DE, P., GHOSH, J.B. e WELLS, C.E. On The Minimization Of Time Variance With Bicriteria Extension. Operations Research. v. 40, n. 6, p. 1148-1155. 1992.
DE, P., GHOSH, J.B. e WELLS, C.E. Job Selection And Sequencing On A Single Machine In A Random Environment. European Journal of Operational Research. v. 70, p. 425-431. 1993.
DELL'AMICO, M. e TRUBIAN, M. Applying Tabu Search To The Job-Shop Scheduling Problem. Annals of Operations Research. v. 41, p. 231-252. 1993.
DOBSON, G. e KARMARKAR, U.S. Simultaneous Resource Scheduling To Minimize Weighted Flow Times. Operations Research. v. 37, n. 4, p. 592-600. 1989.
DOBSON, G., KARMARKAR, U.S. e RUMMEL, J.L. Batching To Minimize Flow Times On Parallel Heterogeneous Machines. Management Science. v. 35, n. 5, p. 607-613. 1989.
DOCTOR, S.R., CAVALIER, T.M. e EGBE:U, P.J. Scheduling For Machining And Assembly In A Job-Shop Environment. International Journal of Production Research. v. 31, n. 6, p. 1275-1297. 1993.
DONDETI, V.T. e EMMONS, H. Fixed Job Scheduling With Two Types Of Processors. Operations Research. v. 40, supp.1, p. S76. 1992.
ELMAGHRABY, S.E. The Machine Sequencing Problem - Review And Extensions. Naval Research Logistics Quarterly. v. 15, p. 205-232. 1968.
EPSTEIN, S., WILAMOWSKY, Y. e DICKMAN, B. Deterministic Multiprocessor Scheduling With Multiple Objectives. Computers Operations Research. v. 19, n. 8, p. 743-749. 1992.
FORST, F.G. Minimizing Total Expected Costs In The Two-Machine, Stochastic Flow Shop. Operations Research Letters. v. 2, p. 58-61. 1983.
FORST, F.G. A Review Of The Static, Stochastic Job Sequencing Literature. Opsearch. v. 21, p. 127-144. 1984.
FRANÇA, P.M., GENDREAU, M., LAPORTE, G. e MÜLLER, F.M. A Composite Heuristic For The Identical Parallel Machine Scheduling Problem With Minimum Makespan Objective. Computer Operations Research. v. 21, n. 2, p. 205-210. 1994.
GALLEGO, G. Scheduling The Production Of Several Items With Random Demands In A Single Facility. Management Science. v. 36, n. 12, p. 1579-1592. 1990.
GAREY, M.R., JOHNSON, D.S. e SETHI, R. The Complexity Of Flowshop And Jobshop Scheduling, Mathematics of Operations Research. v. 1, p. 117-129. 1976.
GLAZEBROOK, K.D. Single-Machine Scheduling Of Stochastic Jobs Subject To Deterioration Or Delay. Naval Research Logistics. v. 39, p. 613-633. 1992.
GODIN, V.B. Interactive Scheduling: Historical Survey And State Of The Art. AIIE Trans. v. 10, p. 331-337. 1978.
GOYAL, S.K. e SRISKANDARAJAH, C. No-Wait Shop Scheduling: Computational Complexity And Approximate Algorithms. Opsearch. v. 25, p. 220-244. 1988.
GORDON, V.S. A Note On Optimal Assignment Of Slack Due-Dates In Single-Machine Scheduling. European Journal of Operational Research. v. 70, p. 311-315. 1993.
GRAHAM, R.L., LAWLER, E.L., LENSTRA, J.K. e RINNOOY KAN, A.H.G. Optimization And Approximation In Deterministic Sequencing And Scheduling: A Survey. Annals of Discrete Mathematics. v. 5, p. 287-326. 1979.
GRAVES, S.G. A Review Of Production Scheduling. Operations Research. v. 29, p. 646-675. 1981.
GUINET, A. Scheduling Sequence-Dependent Jobs On Identical Parallel Machines To Minimize Completion Time Criteria. International Journal of Production Research. v. 31, n. 7, p. 1579-1594. 1993.
GUPTA, J.N.D. e TUNC, E.A. Scheduling For A Two-Stage Hybrid Flowshop With Parallel Machines At The Second Stage. International Journal of Production Research. v. 29, n. 7, 1489-1502. 1991.
GUPTA, M.C., GUPTA, Y.P. e BECTOR, C.R. Minimizing The Flow-Time Variance In Single-Machine Systems. Journal of Operational Research Society. v. 41, n. 8, p. 767-779. 1990.
GUPTA, M.C., GUPTA, Y.P. e KUMAR, A. Minimizing Flow Time Variance In A Single Machine System Using Genetic Algorithms. European Journal of Operational Research. v. 70, p. 289-303. 1993.
HALL, N.G. e POSNER, M.E. Earliness-Tardiness Scheduling Problems, I: Weighted Deviation Of Completion Times About A Common Due Date. Operations Research. v. 39, n. 5, 836-846. 1991.
HALL, N.G., KUBIAK, W e SETHI, S.P. Earliness-Tardiness Scheduling Problems, II: Deviation Of Completion Times About A Restrictive Common Due Date. Operations Research. v. 39, n. 5, p. 836-847. 1991.
HENDRY, L.C. e KINGSMAN, B.G. Production Planning Systems And Their Applicability To Make-To-Order Companies. European Journal of Operational Research. v. 40, p. 1-15. 1989.
HERRBACH, L.A. e LEUNG, J.Y.-T. Preemptive Scheduling Of Equal Length Jobs On Two Machine To Minimize Mean Flow Time. Operations Research. v. 38, n. 3), 487-494. 1990.
HERRMANN, J.W. e LEE, C. On Scheduling To Minimize Earliness-Tardiness And Batch Delivery Costs With A Common Due Date. European Journal of Operational Research. v. 70, p. 272-288. 1992.
HO, J.C., e CHANG, Y.-L. Heuristic For Minimizing Mean Tardiness For M Parallel Machines. Naval Research Logistics. v. 38, p. 367-381. 1991.
HOLSENBACK, J.E. e RUSELL, R.M. A Heuristic Algorithm For The Sequencing On One Machine To Minimize Total Tardiness. Journal of Operational Research Society. v. 43, n. 1, p. 53-62. 1991.
IBARAKI, T. Combinatorial Optimization Problems And Their Complexity, In: Enumerative Approaches To Combinatorial Optimization - Part I. Annals of Operations Research, v. 10. 1987.
IBRAHIM, A. e THOMAS, L.C. A Two-Product, Single-Machine, Storage-Constrained Production Problem. Journal of Operational Research Society. v. 42, n. 9, p. 785-791. 1991.
JEFFCOAT, D.E. e BULFIN, R.L. Simulated Annealing For Resource-Constrained Scheduling. European Journal of Operational Research. v. 70. p. 43-51. 1993.
KAMOUN, H. e SRISKANDARAJAH, C. The Complexity Of Scheduling Jobs In Repetitive Manufacturing Systems. European Journal of Operational Research. v. 70, p. 350-364. 1993.
KARABATI, S., KOUVELIS, P. e KIRAN, A.S. Games, Critical Paths And Assignment Problems In Permutation Flow Shops And Cyclic Scheduling Flow Line Environments. Journal of the Operational Research Society. v. 43, n. 3, p. 241-258. 1992.
KARABATI, S., KOUVELIS, P. Completion Times Performance Criterion. Naval Research Logistics. v. 40, p. 843-862. 1993.
KIM, Y.D. A New Branch And Bound Algorithm For Minimizing Mean Tardiness In Two-Machine Flowshops. Computers Operations Research. v. 20, n. 4, p. 391-401. 1993.
KING, J.R. e SPACHIS, A.S. Scheduling: Bibliography & Review. International Journal of Physical Distribution and Materials Management. v. 10, n. 3, p. 105-132. 1980.
KIRAN, A.S. e UNAL, A.T. A Single-Machine Problem With Multiple Criteria. Naval Research Logistics. v. 38, p. 721-727. 1991.
KULKARNI, V.G. e CHIMENTO Jr., P.F. Optimal Scheduling Of Exponential Task With In-Tree Precedence Constraints On Two Parallel Processors Subject To Failure And Repair. Operations Research. v. 40, supp. n. 2, p. S263. 1992.
LAWRENCE, S.R. Scheduling A Single Machine To Maximize Net Present Value. International Journal of Production Research. v. 29, n. 6, p. 1141-1160. 1991.
LEACHMAN, R.C. e GASCON, A. A Heuristic Scheduling Policy For Multi-Item, Single-Machine Production Systems With Time-Varying, Stochastic Demands. Management Science. v. 34, n. 3, p. 377- 390. 1988.
LEE, I. A Worst-Case Performance Of The Shortest-Processing-Time Heuristic For Single Machine Scheduling. Journal of The Operational Research Society. v. 42, n. 10, p. 895-901. 1991.
LEE,Y.H. e KIM, S. Neural Network Application For Scheduling Jobs On Parallel Machines. Computer and Industrial Engineering. v. 25, n. 1/4, p. 227-230. 1993.
LEE, C.Y., CHENG, T.C.E. e LIN, B.M.T. Minimizing The Makespan In The 3-Machine Assembly-Type Flowshop Scheduling Problem. Management Science. v. 39, n. 5, p. 616-625. 1993.
LEON, V.J. e WU S.D. On Scheduling With Ready-Times, Due-Dates And Vacations. Naval Research Logistics. v. 39, p. 53-65. 1992.
LENSTRA, J.K. Sequencing By Enumerative Methods. Mathematical Centre Tracts 69, Amsterdam. 1977.
LENSTRA, J.K. e RINNOOY KAN, A.H.G. Complexity Of Scheduling Under Precedence Constraints, Operations Research. v. 26, n. 1, p. 22-35. 1978
LENSTRA, J.K., RINNOOY KAN, A.H.G., e BRUCKER, P. Complexity Of Machine Scheduling Problems, Annals of Discrete Mathematics. v. 1, p. 343-362. 1977
LIAO, C.J. e YOU, C.T. An Improved Formulation For The Job-Shop Scheduling Problem. Journal of the Operational Research. v. 43, n. 11, p. 1047-1054. 1992.
LIU, J. e MacCARTHY, B.L. Effective Heuristics For The Single Machine Sequencing Problem With Ready Times. International Journal of Production Research. v. 29, n. 8, p. 1521-1533. 1990.
MACCARTHY B.L e LIU J. Addressing The Gap In Scheduling Research: A Review Of Optimization And Heuristic Methods In Production Scheduling. International Journal of Production Research. v. 31, n. 1, p. 59-79. 1993.
MASON, A.J. e ANDERSON, E.J. Minimizing Flow Time On A Single Machine With Job Classes Setup Times. Naval Research Logistics. v. 38, p. 333-350. 1991.
MATSSURA, H., TSUBONE, H. e KANEZASHI, M. Sequencing, Dispatching, And Switching In A Dynamic Manufacturing Environment. International Journal of Production Research. v. 31, n. 7, p. 1671-1688. 1993
MÜLLER-MERBACH, H. Heuristic And Their Design: A Survey. European Journal of Operational Research. v. 8, p. 1-23. 1981.
MITTENTHAL, J., RAGHAVACHARI, M. e RANAS, A. A Hybrid Simulated Annealing Approach For Single Machine Scheduling Problems With Non-Regular Penalty Functions. Computer Operational Research. v. 20, n. 2, p. 103-111. 1993.
MONMA C.L. e POTTS C.N. On The Complexity Of Scheduling Batch Setup Times. Operations Research. v. 37, p. 798-804. 1989.
NAKANO, R. e YAMADA, T. Conventional Genetic Algorithm For Job Shop Problems. Proc. 4th. Int. Conf. on Genetic Algorithms. San Diego, CA. p. 474-479. 1991.
NANDKEOLYAR, U., AHMED, M.U. e SUNDARARAGHAVEN, P.S. Dynamic Single-Machine-Weighted Absolute Deviation Problem: Predictive Heuristics And Evaluation. International Journal of Production Research. v. 31, n. 6, p. 1453-1466. 1993.
NOWICKI, E. An Approximation Algorithm For The M-Machine Permutation Flow Shop Scheduling With Controllable Processing Times. European Journal of Operational Research. v. 70, p. 342-349. 1993.
PANWALKER, S.S. e ISKANDER, W. A Survey Of Scheduling Rules. Operations Research. v. 25, p. 45-61. 1977.
PANWALKER, S.S., SMITH, M.L. e KOULAMAS, C.P. A Heuristic For Single Machine Tardiness Problem. European Journal of Operational Research. v. 70, p. 304-310. 1993.
POTTS, C.N. e VAN WASSENHOVE, L.N.. Algorithms For Scheduling A Single Machine For Minimizing The Weighted Number Of Late Jobs. Management Science. v. 34, n. 7, p. 843-858. 1988
POTTS, C.N. e VAN WASSENHOVE, L.N. Single Machine Scheduling To Minimize Total Late Work. Operations Research. v. 40, n. 3, p. 586-595. 1992.
PROUST, C., GUPTA, J.N.D. e DESCHAMPS, V. Flowshop Scheduling With Set-Up, Processing And Removal Times Separated. International Journal of Production Research. v. 29, n. 3, p. 479-493. 1991.
RAJENDRAN, C. Two-Stage Flowshop Scheduling Problem With Bicriteria. Journal of the Operational Research Society. v. 43, n. 9, p. 871-884. 1992.
RAJGOPAL, J. e BIDANDA, B. On Scheduling Parallel Machines With Two Setup Classes. International Journal of Production Research. v. 29, n. 12, p. 2243-2458. 1991.
RINNOY KAN, H.H.G. Machine Scheduling Problems: Classification, Complexity And Computations. The Hague: Nijhoff. 1976.
RODAMMER, F.A. e WHITE, Jr. K.P. A Recent Survey Of Production Scheduling. IEEE Transaction on Systems, Man and Cybernetics. v. 18, n. 6, p. 841-851. 1988.
SEN, T. e BORAH, B.N. On The Single-Machine Scheduling Problem With Tardiness Penalties. Journal of Operations Research Society. v. 42, n. 8, p. 695-702. 1991.
SO, K.C. Some Heuristics For Scheduling Jobs On Parallel Machines With Setups. Management Science. v. 36, n. 4, p. 467 - 475. 1990.
STORER, H.R., WU, S,W. e VACCARI, R. New Search Spaces For Sequencing Problems With Application To Job Shop Scheduling. Management Science. v. 38, n. 10, p. 1495-1509. 1992.
SU, Z.S. e SEVCIK, K.C. A Combinatorial Approach To Dynamic Scheduling Problems. Operations Research. v. 26, n. 5, p. 836-844. 1978.
SÜER, G.A. e BÁEZ. Minimizing The Number Of Tardy Jobs In Identical Machine Scheduling. Computer and Industrial Engineering. v. 25, n. 1/4, p. 243-246. 1993.
SUNG. C.S. e JOO, U.G. A Single Machine Scheduling Problem With Earliness/Tardiness And Starting Time Penalties Under A Common Due Date. Computers and Operational Research. v. 19, n. 8, p. 757-766. 1992.
SZWARC, W. Adjacent Orderings In Single-Machine Scheduling With Earliness And Tardiness Penalties. Naval Research Logistics. v. 40, p. 229-243. 1993.
SZWARC, W., POSNER, M.E. e LIU, J.L. The Single Machine Problem With A Quadratic Cost Function Of Completion Time. Management Science. v. 34, n. 12, p. 1480-1488. 1988.
SZWARC, W. e LIU, J.J. Weighted Tardiness Single Machine Scheduling With Proportional Weights. Management Science. v. 39, n. 5, p. 626-632. 1993.
TSUJIMURA, Y., PARK, S.H., CHANG, I.S. e GEN, M. An Effective Method For Solving Flow Shop Scheduling Problems With Fuzzy Processing Times. Computers and Industrial Engineering. v. 25, n. 1/4, p. 239-242. 1993.
ULLMAN, J.D., NP-Complete Scheduling Problems. Journal of Computing System Science. v. 10, p. 384-393. 1975
VAN DE VEL, H. e SHIJIE, S. An Application Of The Bin-Packing Technique To Job Scheduling On Uniform Processors. Journal of The Operational Research Society. v. 42, n. 2, p. 169-172. 1991.
VAN LAARHOVEN, P.J.M., AARTS, E.H.L. e LENSTRA, J.K. Job Shop Scheduling By Simulated Annealing. Operations Research. v. 40, n. 1, p. 113-125. 1992.
VEMPATI, V.S., CHEN, C.-L. e BULLINGTON, S.F. An Effective Heuristic For Flow Shop Problems With Total Flow Time As Criterion. Computers and Industrial Engineering. v. 5, n. 1/4, p. 219-222. 1993.
VICKSON, R.G. e ALFREDSSON, B.E. Two And Three Machine Flow Shop Scheduling Problems With Equal Sized Transfer Batches. International Journal of Production Research. v. 30, n. 7, p. 1551-1574. 1992.
WAGNEUR, E. e SRISKANDARAJAH, C. The Two-Machine Permutation Flow Shop With State-Dependent Processing Times. Naval Research Logistics. v. 40, p. 697-717. 1993.
WEBSTER, S. New Bounds For The Identical Parallel Processor Weighted Flow Time Problem. Management Science. v. 38, n. 1, p. 124-136. 1992.
WEBSTER, S.T. A Priority Rule For Minimizing Weighted Flow Time In A Class Of Parallel Machine Scheduling Problems. European Journal of Operational Research. v. 70, p. 327-334. 1993.
WERNER, F. On The Heuristic Solution Of The Permutation Flow Shop Problem By Path Algorithms. Computers Operations Research. v. 20, n. 7, p. 707-722. 1993.
WIDMER, M. Job Shop Scheduling With Tooling Constraints: A Tabu Search Approach. Journal of the Operational Research Society. v. 42, n. 1, p. 75-82. 1991.
WIDMER, M. e HERTZ, A. A New Method For The Flow Sequencing Problem. European Journal of Operational Research. v. 41, p. 186-193. 1989.
WU, S.D., STORES, R.H. and CHANG, P. One-Machine Rescheduling Heuristic With Efficiency And Stability As Criteria. Computer Operational Research. v. 20, n. 1, p. 1-14. 1993.
ZHENG, W.-X., NAGASAWA, H. e NISHIYAMA, N. Single-Machine Scheduling For Minimizing Total Cost With Identical, Asymmetrical Earliness And Tardiness Penalties. International Journal of Production Research. v. 31, n. 7, p. 1611-1620. 1993.

Datas de Publicação

Publicação nesta coleção
27 Out 2010
Data do Fascículo
Dez 1995

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.

[1] ADAMS, J., BALAS, E. e ZAWACK, D. The Shifting Bottleneck Procedure For Job Shop Scheduling. Management Science. v.34, n.3, p. 391-401. 1988.

[2] ADIRI, I., FROSTIG, E. e RINNOOY KAN, A.H.G. Scheduling On A Single Machine With A Single Breakdown To Minimize Stochastically The Number Of Tardy Jobs. Naval Research Logistics. v. 38, p. 261-271. 1991.

[3] ALIDAEE, B. A Heuristic Solution Procedure To Minimize Makespan On A Single Machine With Non-Linear Cost Functions. Journal of Operational Research Society. v. 41, n.11, p. 1065-1068. 1990.

[4] ALIDAEE, B. e AHMADIAN, A. Two Parallel Machine Sequencing Problems Involving Controllable Job Processing Times. European Journal of Operational Research. v. 70, p. 335-341.1993.

[5] APPLEGATE, D. e COOK, W. A Computational Study Of The Job-Shop Scheduling Problem. ORSA Journal of Computation. v. 3, p. 149-156. 1990.

[6] ARKIN, E.M. e ROUNDY, R.O. Weighted-Tardiness Scheduling On Parallel Machines With Proportional Weights. Operations Research. v. 39, n. 1, p. 64 - 81. 1991.

[7] BAKER, K. e SCUDDER, G.D. Sequencing With Earliness And Tardiness Penalties: A Review. Operations Research. v. 38, p. 22-36. 1990.

[8] BAKSHI, M.S. e ARORA, S.R. The Sequencing Problem. Management Science. v. 16, p. B247-B263. 1969.

[9] BARNES, J.W. e LAGUNA. M. A Tabu Search Experience In Production Scheduling. An s of Operations Research. v. 41, p. 141-156. 1993.

[10] BELLMAN, R., ESOGBUE, A.O. e NABESHIMA, I. Mathematical Aspects Of Scheduling And Applications. Pergamon Press. 1982.

[11] BIEGEL, J.E. e DAVERN, J.J. Genetic Algorithms And The Job Shop Scheduling. Computers and Industrial Engineering. v. 19, n. 1 e 4, p. 81-91. 1990.

[12] BLOCHER, J.D. e CHAND, S. Scheduling Of Parallel Processors: A Posterior Bound On LPT Sequencing And A Two-Step Algorithm. Naval Research Logistics. v. 38, p. 273-287. 1991.

[13] BUXEY, G. Production Scheduling: Practice And Theory. European Journal of Operational Research. v. 39, p. 17-31. 1989.

[14] CADAMBI, B.V. e SATHE, Y.S. Two-Machine Flowshop Scheduling To Minimize Mean Flow Time. Opsearch. v. 30, n. 1, p. 34-41. 1993.

[15] CAO, J. e BEDWORTH, D.D. Flow Shop Scheduling In Serial Multi-Product Processes With Transfer And Set-Up Times. International Journal of Production Research. v. 30, n. 8, p. 1819-1830. 1992.

[16] CARLIER, J. e PINSON, E. An Algorithm For Solving The Job-Shop Problem. Management Science. v. 35, n. 2, p. 164-176. 1989.

[17] CARRENO, J.J. Economic Lot Scheduling For Multiple Products On Parallel Identical Processors. Management Science. v. 36, n. 3, p. 348-358. 1990.

[18] CHAMBERS, R.J., CARRAWAY, R.L., LOWE, T.J e MORIN, T.L. Dominance And Decomposition Heuristics For Single Machine Scheduling. Operations Research. v. 39, n. 4, p. 639-648. 1991.

[19] CHANDRU, V., LEE, C.-Y. e UZSOY, R. Minimizing Total Completion Time On Batch Processing Machines. International Journal of Production Research. v. 31, n. 9, p. 2097-2121. 1993.

[20] CHRYSSOLOURIS, G., DICKE, K. e LEE, M. On The Resource Allocation Problem. International Journal of Production Research. v.31, n.12, p. 2773-2795. 1992.

[21] CHENG, C. e BULFIN R.L. Complexity Of Single Machine, Multi-Criteria Scheduling Problems. European Journal of Operational Research. v. 70, p. 115-125. 1993.

[22] CHU, C. A Branch-And-Bound Algorithm To Minimize Total Flow Time With Unequal Release Dates. Naval Research Logistics. v. 39, p. 859-875. 1992a.

[23] CHU, C. A Branch-And-Bound Algorithm To Minimize Total Tardiness With Different Release Dates. Naval Research Logistics. v. 39, p. 265-283. 1992.

[24] CHU, C, PORTMANN, M.C. e PROTH, J.M. A Splitting-Up Approach To Simplify Job-Shop Scheduling Problems. International Journal of Production Research. v. 30, n. 4, p. 859-870. 1992.

[25] COFFMAN, JR. E.G. Introduction To Deterministic Scheduling Theory. In: Computer And Job-Shop Scheduling Theory. Coffman, Jr.E.G. John Wiley & Sons. 1976.

[26] DAUZERE-PERES, S. The One-Machine Sequencing Problem With Dependent Jobs. Computer and Industrial Engineering, v. 25, n. 1/44, p. 235-238. 1993.

[27] DAUZERE-PERES, S. e LASSERRE, J-B. An Iterative Procedure For Lot Streaming In Job-Shop Scheduling. Computers and Industrial Engineering. v. 25, n. 1/4, p. 231-234. 1993a.

[28] DAUZERE-PERES, S. e LASSERRE, J-B. A Modified Shifting Bottleneck Procedure For Job-Shop Scheduling. International Journal of Production Research. v. 31, n. 4, p. 923-932. 1993.

[29] DAVIS, J.S. e KANET, J.J. Single-Machine Scheduling With Early And Tardy Completion Costs. Naval Research Logistics. v. 40, p. 85-101. 1993.

[30] DAY, J.E e HOTTENSTEIN, M.P. Review Of Sequencing Research. Naval Research Logistics Quarterly. v. 17, p. 11-40. 1970,

[31] DE, P., GHOSH, J.B. e WELLS, C.E. On The Minimization Of Time Variance With Bicriteria Extension. Operations Research. v. 40, n. 6, p. 1148-1155. 1992.

[32] DE, P., GHOSH, J.B. e WELLS, C.E. Job Selection And Sequencing On A Single Machine In A Random Environment. European Journal of Operational Research. v. 70, p. 425-431. 1993.

[33] DELL'AMICO, M. e TRUBIAN, M. Applying Tabu Search To The Job-Shop Scheduling Problem. Annals of Operations Research. v. 41, p. 231-252. 1993.

[34] DOBSON, G. e KARMARKAR, U.S. Simultaneous Resource Scheduling To Minimize Weighted Flow Times. Operations Research. v. 37, n. 4, p. 592-600. 1989.

[35] DOBSON, G., KARMARKAR, U.S. e RUMMEL, J.L. Batching To Minimize Flow Times On Parallel Heterogeneous Machines. Management Science. v. 35, n. 5, p. 607-613. 1989.

[36] DOCTOR, S.R., CAVALIER, T.M. e EGBE:U, P.J. Scheduling For Machining And Assembly In A Job-Shop Environment. International Journal of Production Research. v. 31, n. 6, p. 1275-1297. 1993.

[37] DONDETI, V.T. e EMMONS, H. Fixed Job Scheduling With Two Types Of Processors. Operations Research. v. 40, supp.1, p. S76. 1992.

[38] ELMAGHRABY, S.E. The Machine Sequencing Problem - Review And Extensions. Naval Research Logistics Quarterly. v. 15, p. 205-232. 1968.

[39] EPSTEIN, S., WILAMOWSKY, Y. e DICKMAN, B. Deterministic Multiprocessor Scheduling With Multiple Objectives. Computers Operations Research. v. 19, n. 8, p. 743-749. 1992.

[40] FORST, F.G. Minimizing Total Expected Costs In The Two-Machine, Stochastic Flow Shop. Operations Research Letters. v. 2, p. 58-61. 1983.

[41] FORST, F.G. A Review Of The Static, Stochastic Job Sequencing Literature. Opsearch. v. 21, p. 127-144. 1984.

[42] FRANÇA, P.M., GENDREAU, M., LAPORTE, G. e MÜLLER, F.M. A Composite Heuristic For The Identical Parallel Machine Scheduling Problem With Minimum Makespan Objective. Computer Operations Research. v. 21, n. 2, p. 205-210. 1994.

[43] GALLEGO, G. Scheduling The Production Of Several Items With Random Demands In A Single Facility. Management Science. v. 36, n. 12, p. 1579-1592. 1990.

[44] GAREY, M.R., JOHNSON, D.S. e SETHI, R. The Complexity Of Flowshop And Jobshop Scheduling, Mathematics of Operations Research. v. 1, p. 117-129. 1976.

[45] GLAZEBROOK, K.D. Single-Machine Scheduling Of Stochastic Jobs Subject To Deterioration Or Delay. Naval Research Logistics. v. 39, p. 613-633. 1992.

[46] GODIN, V.B. Interactive Scheduling: Historical Survey And State Of The Art. AIIE Trans. v. 10, p. 331-337. 1978.

[47] GOYAL, S.K. e SRISKANDARAJAH, C. No-Wait Shop Scheduling: Computational Complexity And Approximate Algorithms. Opsearch. v. 25, p. 220-244. 1988.

[48] GORDON, V.S. A Note On Optimal Assignment Of Slack Due-Dates In Single-Machine Scheduling. European Journal of Operational Research. v. 70, p. 311-315. 1993.

[49] GRAHAM, R.L., LAWLER, E.L., LENSTRA, J.K. e RINNOOY KAN, A.H.G. Optimization And Approximation In Deterministic Sequencing And Scheduling: A Survey. Annals of Discrete Mathematics. v. 5, p. 287-326. 1979.

[50] GRAVES, S.G. A Review Of Production Scheduling. Operations Research. v. 29, p. 646-675. 1981.

[51] GUINET, A. Scheduling Sequence-Dependent Jobs On Identical Parallel Machines To Minimize Completion Time Criteria. International Journal of Production Research. v. 31, n. 7, p. 1579-1594. 1993.

[52] GUPTA, J.N.D. e TUNC, E.A. Scheduling For A Two-Stage Hybrid Flowshop With Parallel Machines At The Second Stage. International Journal of Production Research. v. 29, n. 7, 1489-1502. 1991.

[53] GUPTA, M.C., GUPTA, Y.P. e BECTOR, C.R. Minimizing The Flow-Time Variance In Single-Machine Systems. Journal of Operational Research Society. v. 41, n. 8, p. 767-779. 1990.

[54] GUPTA, M.C., GUPTA, Y.P. e KUMAR, A. Minimizing Flow Time Variance In A Single Machine System Using Genetic Algorithms. European Journal of Operational Research. v. 70, p. 289-303. 1993.

[55] HALL, N.G. e POSNER, M.E. Earliness-Tardiness Scheduling Problems, I: Weighted Deviation Of Completion Times About A Common Due Date. Operations Research. v. 39, n. 5, 836-846. 1991.

[56] HALL, N.G., KUBIAK, W e SETHI, S.P. Earliness-Tardiness Scheduling Problems, II: Deviation Of Completion Times About A Restrictive Common Due Date. Operations Research. v. 39, n. 5, p. 836-847. 1991.

[57] HENDRY, L.C. e KINGSMAN, B.G. Production Planning Systems And Their Applicability To Make-To-Order Companies. European Journal of Operational Research. v. 40, p. 1-15. 1989.

[58] HERRBACH, L.A. e LEUNG, J.Y.-T. Preemptive Scheduling Of Equal Length Jobs On Two Machine To Minimize Mean Flow Time. Operations Research. v. 38, n. 3), 487-494. 1990.

[59] HERRMANN, J.W. e LEE, C. On Scheduling To Minimize Earliness-Tardiness And Batch Delivery Costs With A Common Due Date. European Journal of Operational Research. v. 70, p. 272-288. 1992.

[60] HO, J.C., e CHANG, Y.-L. Heuristic For Minimizing Mean Tardiness For M Parallel Machines. Naval Research Logistics. v. 38, p. 367-381. 1991.

[61] HOLSENBACK, J.E. e RUSELL, R.M. A Heuristic Algorithm For The Sequencing On One Machine To Minimize Total Tardiness. Journal of Operational Research Society. v. 43, n. 1, p. 53-62. 1991.

[62] IBARAKI, T. Combinatorial Optimization Problems And Their Complexity, In: Enumerative Approaches To Combinatorial Optimization - Part I. Annals of Operations Research, v. 10. 1987.

[63] IBRAHIM, A. e THOMAS, L.C. A Two-Product, Single-Machine, Storage-Constrained Production Problem. Journal of Operational Research Society. v. 42, n. 9, p. 785-791. 1991.

[64] JEFFCOAT, D.E. e BULFIN, R.L. Simulated Annealing For Resource-Constrained Scheduling. European Journal of Operational Research. v. 70. p. 43-51. 1993.

[65] KAMOUN, H. e SRISKANDARAJAH, C. The Complexity Of Scheduling Jobs In Repetitive Manufacturing Systems. European Journal of Operational Research. v. 70, p. 350-364. 1993.

[66] KARABATI, S., KOUVELIS, P. e KIRAN, A.S. Games, Critical Paths And Assignment Problems In Permutation Flow Shops And Cyclic Scheduling Flow Line Environments. Journal of the Operational Research Society. v. 43, n. 3, p. 241-258. 1992.

[67] KARABATI, S., KOUVELIS, P. Completion Times Performance Criterion. Naval Research Logistics. v. 40, p. 843-862. 1993.

[68] KIM, Y.D. A New Branch And Bound Algorithm For Minimizing Mean Tardiness In Two-Machine Flowshops. Computers Operations Research. v. 20, n. 4, p. 391-401. 1993.

[69] KING, J.R. e SPACHIS, A.S. Scheduling: Bibliography & Review. International Journal of Physical Distribution and Materials Management. v. 10, n. 3, p. 105-132. 1980.

[70] KIRAN, A.S. e UNAL, A.T. A Single-Machine Problem With Multiple Criteria. Naval Research Logistics. v. 38, p. 721-727. 1991.

[71] KULKARNI, V.G. e CHIMENTO Jr., P.F. Optimal Scheduling Of Exponential Task With In-Tree Precedence Constraints On Two Parallel Processors Subject To Failure And Repair. Operations Research. v. 40, supp. n. 2, p. S263. 1992.

[72] LAWRENCE, S.R. Scheduling A Single Machine To Maximize Net Present Value. International Journal of Production Research. v. 29, n. 6, p. 1141-1160. 1991.

[73] LEACHMAN, R.C. e GASCON, A. A Heuristic Scheduling Policy For Multi-Item, Single-Machine Production Systems With Time-Varying, Stochastic Demands. Management Science. v. 34, n. 3, p. 377- 390. 1988.

[74] LEE, I. A Worst-Case Performance Of The Shortest-Processing-Time Heuristic For Single Machine Scheduling. Journal of The Operational Research Society. v. 42, n. 10, p. 895-901. 1991.

[75] LEE,Y.H. e KIM, S. Neural Network Application For Scheduling Jobs On Parallel Machines. Computer and Industrial Engineering. v. 25, n. 1/4, p. 227-230. 1993.

[76] LEE, C.Y., CHENG, T.C.E. e LIN, B.M.T. Minimizing The Makespan In The 3-Machine Assembly-Type Flowshop Scheduling Problem. Management Science. v. 39, n. 5, p. 616-625. 1993.

[77] LEON, V.J. e WU S.D. On Scheduling With Ready-Times, Due-Dates And Vacations. Naval Research Logistics. v. 39, p. 53-65. 1992.

[78] LENSTRA, J.K. Sequencing By Enumerative Methods. Mathematical Centre Tracts 69, Amsterdam. 1977.

[79] LENSTRA, J.K. e RINNOOY KAN, A.H.G. Complexity Of Scheduling Under Precedence Constraints, Operations Research. v. 26, n. 1, p. 22-35. 1978

[80] LENSTRA, J.K., RINNOOY KAN, A.H.G., e BRUCKER, P. Complexity Of Machine Scheduling Problems, Annals of Discrete Mathematics. v. 1, p. 343-362. 1977

[81] LIAO, C.J. e YOU, C.T. An Improved Formulation For The Job-Shop Scheduling Problem. Journal of the Operational Research. v. 43, n. 11, p. 1047-1054. 1992.

[82] LIU, J. e MacCARTHY, B.L. Effective Heuristics For The Single Machine Sequencing Problem With Ready Times. International Journal of Production Research. v. 29, n. 8, p. 1521-1533. 1990.

[83] MACCARTHY B.L e LIU J. Addressing The Gap In Scheduling Research: A Review Of Optimization And Heuristic Methods In Production Scheduling. International Journal of Production Research. v. 31, n. 1, p. 59-79. 1993.

[84] MASON, A.J. e ANDERSON, E.J. Minimizing Flow Time On A Single Machine With Job Classes Setup Times. Naval Research Logistics. v. 38, p. 333-350. 1991.

[85] MATSSURA, H., TSUBONE, H. e KANEZASHI, M. Sequencing, Dispatching, And Switching In A Dynamic Manufacturing Environment. International Journal of Production Research. v. 31, n. 7, p. 1671-1688. 1993

[86] MÜLLER-MERBACH, H. Heuristic And Their Design: A Survey. European Journal of Operational Research. v. 8, p. 1-23. 1981.

[87] MITTENTHAL, J., RAGHAVACHARI, M. e RANAS, A. A Hybrid Simulated Annealing Approach For Single Machine Scheduling Problems With Non-Regular Penalty Functions. Computer Operational Research. v. 20, n. 2, p. 103-111. 1993.

[88] MONMA C.L. e POTTS C.N. On The Complexity Of Scheduling Batch Setup Times. Operations Research. v. 37, p. 798-804. 1989.

[89] NAKANO, R. e YAMADA, T. Conventional Genetic Algorithm For Job Shop Problems. Proc. 4th. Int. Conf. on Genetic Algorithms. San Diego, CA. p. 474-479. 1991.

[90] NANDKEOLYAR, U., AHMED, M.U. e SUNDARARAGHAVEN, P.S. Dynamic Single-Machine-Weighted Absolute Deviation Problem: Predictive Heuristics And Evaluation. International Journal of Production Research. v. 31, n. 6, p. 1453-1466. 1993.

[91] NOWICKI, E. An Approximation Algorithm For The M-Machine Permutation Flow Shop Scheduling With Controllable Processing Times. European Journal of Operational Research. v. 70, p. 342-349. 1993.

[92] PANWALKER, S.S. e ISKANDER, W. A Survey Of Scheduling Rules. Operations Research. v. 25, p. 45-61. 1977.

[93] PANWALKER, S.S., SMITH, M.L. e KOULAMAS, C.P. A Heuristic For Single Machine Tardiness Problem. European Journal of Operational Research. v. 70, p. 304-310. 1993.

[94] POTTS, C.N. e VAN WASSENHOVE, L.N.. Algorithms For Scheduling A Single Machine For Minimizing The Weighted Number Of Late Jobs. Management Science. v. 34, n. 7, p. 843-858. 1988

[95] POTTS, C.N. e VAN WASSENHOVE, L.N. Single Machine Scheduling To Minimize Total Late Work. Operations Research. v. 40, n. 3, p. 586-595. 1992.

[96] PROUST, C., GUPTA, J.N.D. e DESCHAMPS, V. Flowshop Scheduling With Set-Up, Processing And Removal Times Separated. International Journal of Production Research. v. 29, n. 3, p. 479-493. 1991.

[97] RAJENDRAN, C. Two-Stage Flowshop Scheduling Problem With Bicriteria. Journal of the Operational Research Society. v. 43, n. 9, p. 871-884. 1992.

[98] RAJGOPAL, J. e BIDANDA, B. On Scheduling Parallel Machines With Two Setup Classes. International Journal of Production Research. v. 29, n. 12, p. 2243-2458. 1991.

[99] RINNOY KAN, H.H.G. Machine Scheduling Problems: Classification, Complexity And Computations. The Hague: Nijhoff. 1976.

[100] RODAMMER, F.A. e WHITE, Jr. K.P. A Recent Survey Of Production Scheduling. IEEE Transaction on Systems, Man and Cybernetics. v. 18, n. 6, p. 841-851. 1988.

[101] SEN, T. e BORAH, B.N. On The Single-Machine Scheduling Problem With Tardiness Penalties. Journal of Operations Research Society. v. 42, n. 8, p. 695-702. 1991.

[102] SO, K.C. Some Heuristics For Scheduling Jobs On Parallel Machines With Setups. Management Science. v. 36, n. 4, p. 467 - 475. 1990.

[103] STORER, H.R., WU, S,W. e VACCARI, R. New Search Spaces For Sequencing Problems With Application To Job Shop Scheduling. Management Science. v. 38, n. 10, p. 1495-1509. 1992.

[104] SU, Z.S. e SEVCIK, K.C. A Combinatorial Approach To Dynamic Scheduling Problems. Operations Research. v. 26, n. 5, p. 836-844. 1978.

[105] SÜER, G.A. e BÁEZ. Minimizing The Number Of Tardy Jobs In Identical Machine Scheduling. Computer and Industrial Engineering. v. 25, n. 1/4, p. 243-246. 1993.

[106] SUNG. C.S. e JOO, U.G. A Single Machine Scheduling Problem With Earliness/Tardiness And Starting Time Penalties Under A Common Due Date. Computers and Operational Research. v. 19, n. 8, p. 757-766. 1992.

[107] SZWARC, W. Adjacent Orderings In Single-Machine Scheduling With Earliness And Tardiness Penalties. Naval Research Logistics. v. 40, p. 229-243. 1993.

[108] SZWARC, W., POSNER, M.E. e LIU, J.L. The Single Machine Problem With A Quadratic Cost Function Of Completion Time. Management Science. v. 34, n. 12, p. 1480-1488. 1988.

[109] SZWARC, W. e LIU, J.J. Weighted Tardiness Single Machine Scheduling With Proportional Weights. Management Science. v. 39, n. 5, p. 626-632. 1993.

[110] TSUJIMURA, Y., PARK, S.H., CHANG, I.S. e GEN, M. An Effective Method For Solving Flow Shop Scheduling Problems With Fuzzy Processing Times. Computers and Industrial Engineering. v. 25, n. 1/4, p. 239-242. 1993.

[111] ULLMAN, J.D., NP-Complete Scheduling Problems. Journal of Computing System Science. v. 10, p. 384-393. 1975

[112] VAN DE VEL, H. e SHIJIE, S. An Application Of The Bin-Packing Technique To Job Scheduling On Uniform Processors. Journal of The Operational Research Society. v. 42, n. 2, p. 169-172. 1991.

[113] VAN LAARHOVEN, P.J.M., AARTS, E.H.L. e LENSTRA, J.K. Job Shop Scheduling By Simulated Annealing. Operations Research. v. 40, n. 1, p. 113-125. 1992.

[114] VEMPATI, V.S., CHEN, C.-L. e BULLINGTON, S.F. An Effective Heuristic For Flow Shop Problems With Total Flow Time As Criterion. Computers and Industrial Engineering. v. 5, n. 1/4, p. 219-222. 1993.

[115] VICKSON, R.G. e ALFREDSSON, B.E. Two And Three Machine Flow Shop Scheduling Problems With Equal Sized Transfer Batches. International Journal of Production Research. v. 30, n. 7, p. 1551-1574. 1992.

[116] WAGNEUR, E. e SRISKANDARAJAH, C. The Two-Machine Permutation Flow Shop With State-Dependent Processing Times. Naval Research Logistics. v. 40, p. 697-717. 1993.

[117] WEBSTER, S. New Bounds For The Identical Parallel Processor Weighted Flow Time Problem. Management Science. v. 38, n. 1, p. 124-136. 1992.

[118] WEBSTER, S.T. A Priority Rule For Minimizing Weighted Flow Time In A Class Of Parallel Machine Scheduling Problems. European Journal of Operational Research. v. 70, p. 327-334. 1993.

[119] WERNER, F. On The Heuristic Solution Of The Permutation Flow Shop Problem By Path Algorithms. Computers Operations Research. v. 20, n. 7, p. 707-722. 1993.

[120] WIDMER, M. Job Shop Scheduling With Tooling Constraints: A Tabu Search Approach. Journal of the Operational Research Society. v. 42, n. 1, p. 75-82. 1991.

[121] WIDMER, M. e HERTZ, A. A New Method For The Flow Sequencing Problem. European Journal of Operational Research. v. 41, p. 186-193. 1989.

[122] WU, S.D., STORES, R.H. and CHANG, P. One-Machine Rescheduling Heuristic With Efficiency And Stability As Criteria. Computer Operational Research. v. 20, n. 1, p. 1-14. 1993.

[123] ZHENG, W.-X., NAGASAWA, H. e NISHIYAMA, N. Single-Machine Scheduling For Minimizing Total Cost With Identical, Asymmetrical Earliness And Tardiness Penalties. International Journal of Production Research. v. 31, n. 7, p. 1611-1620. 1993.

Brasil

Brasil

Problema de programação da produção um esquema de classificação

Resumos

Datas de Publicação