230
Views
168
CrossRef citations to date
0
Altmetric
Original Articles

Scheduling batch processing machines with incompatible job families

Pages 2685-2708 | Received 01 Oct 1994, Published online: 25 Jun 2007

References

  • AHMADI , J. H. , AHMADI , R. H. , DASU , S. , and TANG , C. S. , 1992 , Batching and scheduling jobs on batch and discrete processors . Operations Research , 40 , 750 – 763 .
  • BAKER , K. R. , 1974 , Introduction to Sequencing and Scheduling . ( New York Wiley ).
  • CARLIER , J- , 1982 , The One-Machine Sequencing Problem . European Journal of Operational Research , 11 , 42 – 47 .
  • CHAND , S. , TRAUB , R. , and UZSOY , R. , 1993 , Single machine scheduling problems with dynamic arrivals decomposition results and a forward algorithm. Research Report , School of Industrial Engineering, Purdue University .
  • CHANDRA , P. , and GUPTA , S. , 1992 , An analysis of a last-station-bottleneck semiconductor packaging line . Research Report , Faculty of Management, McGill University ( 1992 ).
  • CHANDRU , V. , LEE , C. Y. , and UZSOY , R. , 1993 a, Minimizing total completion time on batch processing machines . International Journal of Production Research , 31 , 2097 – 2121 .
  • CHANDRU , V. , LEE , C. Y. , and UZSOY , R. , 1993 b. Minimizing total completion time on a batch processing machine with job families . Operations Research Letters , 13 , 61 – 65 .
  • DEB , R. K- , and SERFOZO , R. F. , 1973 , Optimal control of batch service queues . Advances in Applied Probability , 5 , 340 – 361 .
  • DOBSON , G. , and NABINADOM , R. S. , 1992 , The batch loading and scheduling problem . Research Report , Simon Graduate School of Business Administration, University of Rochester .
  • FOWLER , J. W. , PHILLIPS , D. T. , and HOGG , G. L. , 1992 , Real-time control of multiproduct bulk-service semiconductor manufacturing processes . IEEE Transactions on Semiconductor Manufacturing , 5 , 158 – 163 .
  • GAREY , M. R. , and JOHNSON , D. S. , 1979 , Computers and intractability a guide to the theory of NP-completeness ( San Francisco W. H. Freeman ).
  • GLASSEY , C. R. , and WENG , W. W. , 1991 , Dynamic batching heuristics for simultaneous processing . IEEE Transactions on Semiconductor Manufacturing , 4 , 77 – 82 .
  • GRAHAM , R. L. , 1969 , Bounds on multiprocessor tinning anomalies . SIAM Journal of Applied Mathematics , 17 , 416 – 429 .
  • GURNANI , H. , ANUPINDI , R. , and AKELLA , R. , 1992 , Control of batch processing systems in semiconductor wafer fabrication facilities . IEEE Transactions on Semiconductor Manufacturing , 5 , 319 – 328 .
  • IKURA , Y. , and GIMPLE , M. , 1986 , Scheduling algorithms for a single batch processing machine . Operations Research Letters , 5 , 61 – 65 .
  • KAWAGUCHI , T. , and KYAN , S. , 1986 , Worst case of an LRF schedule for the mean weighted flow time problem . SIAM Journal on Computing , 15 , 1119 – 1129 .
  • LAGEWEG , B. J. , LAWLER , E. L. , LENSTRA , J. K. ,RINNOOY KAN , A. H. G. , 1981 , Computer aided complexity classification of deterministic scheduling problems . Research Report BW 138/81 , Mathematisch Centrum , Amsterdam .
  • LEE , C. Y. , and UZSOY , R. , 1992 , A new dynamic programming algorithm for the parallel machine total weighted completion time problem . Operations Research Letters , 11 , 73 – 75 .
  • LEE , C. Y. , UZSOY , R. , and MARTIN-VEGA , L. A. , 1992 , Efficient algorithms for scheduling batch processing machines . Operations Research , 40 , 764 – 775 .
  • LENSTRA , J. K. , 1977 , Sequencing by Enumerative Methods . Mathematical Centre Tract 69 , Mathematisch Centrum , Amsterdam .
  • MASUDA , T. , ISHII , H. , and NISHIDA , T. , 1983 , Some bounds on approximation algorithms for n/m/l/Lmax and n/2/Lmax scheduling problems . Journal of the Operations Research Society of Japan , 26 , 212 – 224 .
  • OVACIK , I. M. , and UZSOY , R. , 1992 , A shifting bottleneck algorithm for scheduling semiconductor testing operations . Journal of Electronics Manufacturing , 2 , 119 – 134 .
  • OVACIK , I. M. , and UZSOY , R. , 1994 a, Exploiting shop floor status information to schedule complex job shops . Journal of Manufacturing Systems , 13 , 73 – 84 .
  • OVACIK , I. M. , and UZSOY , R. , 1994 b, Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times . International Journal of Production Research , 32 , 1243 – 1263 .
  • POTTS , C. N. , 1980 , Analysis of a heuristic for one machine sequencing with release dates and delivery times . Operations Research , 28 , 1436 – 1441 .
  • ROTHKOPF , M. H. , 1966 , Scheduling independent tasks on parallel processors , Management Science , 12 , 437 – 147 .
  • RUNYAN , W. R. , and BEAN , K. E. , 1990 , Semiconductor Integrated Circuit Processing Technology ( New York Addison-Wesley ).
  • UZSOY , R. , 1994 , Scheduling a single batch processing machine with nonidentical job sizes . International Journal of Production Research , 32 , 1615 – 1635 .
  • UZSOY , R. , LEE , C. Y. , and MARTIN-VEGA , L. A. , 1992 , A review of production planning and scheduling models in the semiconductor industry part I system characteristics, performance evaluation and production planning . HE Transactions on Scheduling and Logistics , 24 , 47 – 61 .
  • UZSOY , R. , LEE , C. Y. , and MARTIN-VEGA , L. A. , 1994 , A survey of production planning and scheduling models in the semiconductor industry part II shop-floor control . HE Transactions on Scheduling and Logistics , 26 , 44 – 55 .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.