Advanced search
Publication Cover
Engineering Optimization Volume 49, 2017 - Issue 1
Submit an article Journal homepage
369
Views
15
CrossRef citations to date
0
Altmetric
Original Articles

Open shop scheduling problem to minimize total weighted completion time

Danyu BaiSchool of Economics & Management, Shenyang University of Chemical Technology, Shenyang, PR ChinaView further author information
,
Zhihai ZhangDepartment of Industrial Engineering, Tsinghua University, Beijing, PR ChinaCorrespondence[email protected]
View further author information
,
Qiang ZhangSoftware College, Northeastern University, Shenyang, PR ChinaView further author information
&
Mengqian TangSoftware College, Northeastern University, Shenyang, PR ChinaView further author information
Pages 98-112 | Received 06 Jul 2015, Accepted 02 Mar 2016, Published online: 18 Apr 2016

References

  • Achugbue, J. O., and F. Y. Chin. 1982. “Scheduling the Open Shop to Minimize Mean Flow Time.” SIAM Journal on Computing 11: 709–720. doi: 10.1137/0211058
  • Ahmadizar, F., and M. H. Farahani. 2012. “A Novel Hybrid Genetic Algorithm for the Open Shop Scheduling Problem.” The International Journal of Advanced Manufacturing Technology 62: 775–787. doi: 10.1007/s00170-011-3825-1
  • Bräsel, H., A. Herms, M. Mörig, T. Tautenhahn, J. Tusch, and F. Werner. 2008. “Heuristic Constructive Algorithms for Open Shop Scheduling to Minimize Mean Flow Time.” European Journal of Operational Research 189: 856–870. doi: 10.1016/j.ejor.2007.02.057
  • Brucker, P., B. Jurisch, and M. Jurisch. 1993. “Open Shop Problems with Unit Time Operations.” ZOR – Methods and Models of Operations Research 37: 59–73. doi: 10.1007/BF01415528
  • Chen, B., C. N. Potts, and G. J. Woeginger. 1998. “A Review of Machine Scheduling: Complexity, Algorithms and Approximability.” In Handbook of Combinatorial Optimization, edited by D.-Z. Du and P. Pardalos, 21–169. London: Kluwer Academic Publishers.
  • Glover, F. 1989. “Tabu Search—Part I.” ORSA Journal on Computing 1: 190–206. doi: 10.1287/ijoc.1.3.190
  • Glover, F. 1990. “Tabu Search—Part II.” ORSA Journal on Computing 2: 4–32. doi: 10.1287/ijoc.2.1.4
  • Gonzalez, T., and S. Sahni. 1976. “Open Shop Scheduling to Minimize Finish Time.” Journal of the ACM 23: 665–679. doi: 10.1145/321978.321985
  • Lann, A., G. Mosheiov, and Y. Rinott. 1998. “Asymptotic Optimality in Probability of a Heuristic Schedule for Open Shops with Job Overlaps.” Operations Research Letters 22: 63–68. doi: 10.1016/S0167-6377(98)00007-8
  • Liaw, C.-F., C.-Y. Cheng, and M. Chen. 2002. “The Total Completion Time Open Shop Scheduling Problem with a Given Sequence of Jobs on One Machine.” Computers & Operations Research 29: 1251–1266. doi: 10.1016/S0305-0548(01)00028-4
  • Panahi, H., and R. Tavakkoli-Moghaddam. 2011. “Solving a Multi-objective Open Shop Scheduling Problem by a Novel Hybrid ant Colony Optimization.” Expert Systems with Applications 38: 2817–2822. doi: 10.1016/j.eswa.2010.08.073
  • Potts, C. N., and V. A. Strusevich. 2009. “Fifty Years of Scheduling: A Survey of Milestones.” Journal of the Operational Research Society 60: S41–S68. doi: 10.1057/jors.2009.2
  • Queyranne, M., and M. Sviridenko. 2000. “New and Improved Algorithms for Minsum Shop Scheduling.” SODA ‘00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, 871–878.
  • Sha, D. Y., and C.-Y. Hsu. 2008. “A New Particle Swarm Optimization for the Open Shop Scheduling Problem.” Computers & Operations Research 35: 3243–3261. doi: 10.1016/j.cor.2007.02.019
  • Spaccamela, A. M., W. S. Rhee, L. Stougie, and S. Van de Geer. 1992. “Probabilistic Analysis of the Minimum Weighted Flowtime Scheduling Problem.” Operations Research Letters 11: 67–71. doi: 10.1016/0167-6377(92)90034-Z
  • Storn, R., and K. Price. 1997. “Differential Evolution—A Simple and Efficient Heuristic for Global Optimization Over Continuous Spaces.” Journal of Global Optimization 11: 341–359. doi: 10.1023/A:1008202821328
  • Tang, L., and D. Bai. 2010. “A New Heuristic for Open Shop Total Completion Time Problem.” Applied Mathematical Modelling 34: 735–743. doi: 10.1016/j.apm.2009.06.014

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:

Order Reprints Request Corporate Permissions

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:

Request Academic Permissions

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.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.