Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2016, Article ID 3203728, 5 pages
http://dx.doi.org/10.1155/2016/3203728
Research Article

Parallel Machine Scheduling with Nested Processing Set Restrictions and Job Delivery Times

1Key Laboratory of Intelligent Information Processing in Universities of Shandong (Shandong Institute of Business and Technology), Yantai 264005, China
2College of Computer Science and Technology, Shandong Institute of Business and Technology, Yantai 264005, China

Received 7 June 2016; Accepted 4 September 2016

Academic Editor: Bruno G. M. Robert

Copyright © 2016 Shuguang Li. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. J. Y.-T. Leung and C.-L. Li, “Scheduling with processing set restrictions: a survey,” International Journal of Production Economics, vol. 116, no. 2, pp. 251–262, 2008. View at Publisher · View at Google Scholar · View at Scopus
  2. J. Y. Leung and C. Li, “Scheduling with processing set restrictions: a literature update,” International Journal of Production Economics, vol. 175, pp. 1–11, 2016. View at Publisher · View at Google Scholar
  3. H. Kise, T. Ibaraki, and H. Mine, “Performance analysis of six approximation algorithms for the one-machine maximum lateness scheduling problem with ready times,” Journal of the Operations Research Society of Japan, vol. 22, no. 3, pp. 205–224, 1979. View at Google Scholar · View at MathSciNet
  4. R. L. Graham, E. L. Lawler, J. K. Lenstra, and A. H. Rinnooy Kan, “Optimization and approximation in deterministic sequencing and scheduling: a survey,” Annals of Discrete Mathematics, vol. 5, pp. 287–326, 1979. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  5. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, vol. 174, W. H. Freeman, New York, NY, USA, 1979. View at MathSciNet
  6. C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Courier Dover, 1998.
  7. G. J. Woeginger, “Heuristics for parallel machine scheduling with delivery times,” Acta Informatica, vol. 31, no. 6, pp. 503–512, 1994. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  8. C. N. Potts, “Analysis of a heuristic for one machine sequencing with release dates and delivery times,” Operations Research, vol. 28, no. 6, pp. 1436–1441, 1980. View at Publisher · View at Google Scholar · View at MathSciNet
  9. L. A. Hall and D. B. Shmoys, “Jackson's rule for single-machine scheduling: making a good heuristic better,” Mathematics of Operations Research, vol. 17, no. 1, pp. 22–35, 1992. View at Publisher · View at Google Scholar · View at MathSciNet
  10. L. A. Hall and D. B. Shmoys, “Approximation schemes for constrained scheduling problems,” in Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science, pp. 134–139, 1989.
  11. M. Mastrolilli, “Efficient approximation schemes for scheduling problems with release dates and delivery times,” Journal of Scheduling, vol. 6, no. 6, pp. 521–531, 2003. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  12. C. A. Glass and H. Kellerer, “Parallel machine scheduling with job assignment restrictions,” Naval Research Logistics, vol. 54, no. 3, pp. 250–257, 2007. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  13. Y. Huo and J. Y.-T. Leung, “Parallel machine scheduling with nested processing set restrictions,” European Journal of Operational Research, vol. 204, no. 2, pp. 229–236, 2010. View at Publisher · View at Google Scholar
  14. Y. Huo and J. Y.-T. Leung, “Fast approximation algorithms for job scheduling with processing set restrictions,” Theoretical Computer Science, vol. 411, no. 44–46, pp. 3947–3955, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  15. G. Muratore, U. M. Schwarz, and G. J. Woeginger, “Parallel machine scheduling with nested job assignment restrictions,” Operations Research Letters, vol. 38, no. 1, pp. 47–50, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  16. L. Epstein and A. Levin, “Scheduling with processing set restrictions: PTAS results for several variants,” International Journal of Production Economics, vol. 133, no. 2, pp. 586–595, 2011. View at Publisher · View at Google Scholar · View at Scopus
  17. R. L. Graham, “Bounds for certain multiprocessing anomalies,” Bell System Technical Journal, vol. 45, no. 9, pp. 1563–1581, 1966. View at Publisher · View at Google Scholar
  18. J. R. Jackson, “Scheduling a production line to minimize maximum tardiness,” DTIC Document, 1955.