Assembly-Line Scheduling with Concurrent Operations and Parallel Machines

References

• Ahmadi J., Ahmadi R., Matsuo H., Tirupati D. Component fixture positioning/sequencing for printed circuit board assembly with concurrent operations. Operations Research (1995) 43:444–457Link, Google Scholar
• Ahmadi J. H., Ali A. I. Integrated production scheduling in large-scale flexible electronic parts manufacturing. Annals of Operations Research (1988) 15:269–287Crossref, Google Scholar
• Ahmadi J., Grotzinger S., Johnson D. Component allocation and partitioning for a dual delivery placement machine. Operations Research (1988) 36:176–191Link, Google Scholar
• Ahmadi R. H., Kouvelis P. Staging problem of a dual delivery pick-and-place machine in printed circuit card assembly. Operations Research (1994) 42:81–91Link, Google Scholar
• Ahmadi R. H., Matsuo H. The line segmentation problem. Operations Research (1991) 39:42–55Link, Google Scholar
• Ball M. O., Magazine M. J. Sequencing of insertions in printed circuit board assembly. Operations Research (1988) 36:192–201Link, Google Scholar
• Bárány I. A vector-sum theorem and its application to improving flow shop guarantees. Mathematics of Operations Research (1981) 6:445–452Link, Google Scholar
• Chen B., Du D-Z., Sun J. Scheduling multiprocessor flow shops. New Advances in Optimization and Approximation (1994) (Kluwer, Dordrecht, The Netherlands) 1–8Crossref, Google Scholar
• Garey M. R., Johnson D. S., Sethi R. The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research (1976) 1:117–129Link, Google Scholar
• Graham R. L. Bounds for certain multiprocessing anomalies. Bell System Tech. Journal (1966) 45:1563–1581Crossref, Google Scholar
• Hoogeveen J. A., Lenstra J. K., Veltman B. Preemptive scheduling in a two-stage multiprocessor flow shop is NPhard. European Journal of Operational Research (1996) 89:172–175Crossref, Google Scholar
• Koulamas C., Kyparisis G. J. Concurrent flowshop scheduling. (2000) . Working Paper, Department of Decision Sciences and Information Systems, Florida International University, Miami, FLGoogle Scholar
• Lee C-Y., Cheng T. C. E., Lin B. M. T. Minimizing the makespan in the 3-machine assembly-type flowshop scheduling problem. Management Science (1993) 39:616–625Link, Google Scholar
• Lee C-Y., Vairaktarakis G. L. Minimizing makespan in hybrid flowshops. Operations Research Letters (1994) 16:149–158Crossref, Google Scholar
• McCormick S. T., Pinedo M. L., Shenker S., Wolf B. Sequencing in an assembly line with blocking to minimize cycle time. Operations Research (1989) 37:925–935Link, Google Scholar
• Potts C. N., Sevast'janov S. V., Strusevich V. A., Van Wassenhove L. N., Zwaneveld C. M. The two-stage assembly scheduling problem: complexity and approximation. Operations Research (1995) 43:346–355Link, Google Scholar
• Sevast'janov S. V. On compact vector summation. Diskretnaya Matematika (1991) 3:66–72in RussianGoogle Scholar
• Sevast'janov S. V. On some geometric methods in scheduling theory: a survey. Discrete Applied Mathematics (1994) 55:59–82Crossref, Google Scholar
• Sevast'janov S. Vector summation in Banach space and polynomial algorithms for flow shops and open shops. Mathematics of Operations Research (1995) 20:90–103Link, Google Scholar