跳至主要内容

Literature Review of Open Shop Scheduling Problems

Read  full  paper  at：
http://www.scirp.org/journal/PaperInformation.aspx?PaperID=53605#.VMntwizQrzE

ABSTRACT
This paper discusses review of literature of open shop scheduling problems. First, the problem is classified as per different measures of performance, viz., minimization of makespan, minimization of sum of completion times of jobs, minimization of sum of weighted completion times of all jobs, minimization of total tardiness of all jobs, minimization of sum of weighted tardiness of all jobs, minimization of weighted sum of tardy jobs, and miscellaneous measures of the open shop scheduling problem. In each category, the literature is further classified based on approaches used and then the contributions of researchers in the respective categories are presented. Directions for future research are discussed in the end.
 
Cite this paper
Anand, E. and Panneerselvam, R. (2015) Literature Review of Open Shop Scheduling Problems. Intelligent Information Management, 7, 33-52. doi: 10.4236/iim.2015.71004.
 
References
[1]Panneerselvam, R. (1999) Heuristic for Moderated Job Shop Scheduling Problem to Minimize Makespan. Industrial Engineering Journal, 28, 26-29.
 
[2]Graham, R.L., Lawler, E.L., Lenstra, J.K. and Rinnooy Kan, A.H.G. (1979) Optimization and Approximation in Deterministic Sequencing and Scheduling—A Survey. Annals of Discrete Mathe-matics, 5, 287-326.http://dx.doi.org/10.1016/S0167-5060(08)70356-X
 
[3]Kubiak, W., Sriskandarajah, C. and Zaras, K. (1991) A Note on the Complexity of Open Shop Scheduling Problems. Canadian Journal of Information Systems and Operational Research, 29, 284-294.
 
[4]Roemer, T.A. (2006) A Note on the Complexity of the Concurrent Open Shop Problem. Journal of Scheduling, 9, 389- 396. http://dx.doi.org/10.1007/s10951-006-7042-y
 
[5]Brucker, P., Knust, S., Edwin Cheng, T.C. and Shakhlevich, N.V. (2004) Complexity Results for Flow-Shop and Open-Shop Scheduling Problems with Transportation Delays. Annals of Operations Research, 129, 81-106.http://dx.doi.org/10.1023/B:ANOR.0000030683.64615.c8
 
[6]Brasel, H., Harborth, M., Tautenhahn, T. and Willenius, P. (1999) On the Set of Solutions of Open Shop Problem. Annals of Operations Research, 92, 241-263.
http://dx.doi.org/10.1023/A:1018938915709
 
[7]Akker, M.V.D., Hoogeven, H. and Woeginger, G.J. (2003) The Two-Machine Open Shop Problem: To Fit or Not to Fit, That Is the Question. Operations Research Letters, 31, 219-224.
http://dx.doi.org/10.1016/S0167-6377(03)00018-X
 
[8]Gonzalez, T. and Sahni, S. (1976) Open Shop Scheduling to Minimize Finish Time. Journal of the Association for Computing Machinery, 23, 665-679. http://dx.doi.org/10.1145/321978.321985
 
[9]Kubale, M. and Nadolski, A. (2005) Chromatic Scheduling in a Cyclic Open Shop. European Journal of Operational Research, 164, 585-591. http://dx.doi.org/10.1016/j.ejor.2003.06.047
 
[10]Masuda, T. and Ishii, H. (1994) Two Machine Open Shop Scheduling Problem with Bi-Criteria. Discrete Applied Mathematics, 52, 253-259. http://dx.doi.org/10.1016/0166-218X(94)90144-9
 
[11]Kis, T., de Werra, D. and Kubiak, W. (2010) A Projective Algorithm for Preemptive Open Shop Scheduling with Two Multiprocessor Groups. Operations Research Letters, 38, 129-132.
http://dx.doi.org/10.1016/j.orl.2009.10.007
 
[12]Schuurman, P. and Woeginger, G.J. (1997) Approximation Algorithms for the Multiprocessor Open Shop Scheduling Problems. Memorandum COSOR 97-23, Eindhoven University of Technology, Eindhoven.
 
[13]Kyparisis, G.J. and Koulamas, C. (1997) Open Shop Scheduling with Maximal Machines. Discrete Applied Mathematics, 78, 175-187. http://dx.doi.org/10.1016/S0166-218X(97)00018-8
 
[14]Brucker, P., Hurink, J., Jurisch, B. and Wostmann, B. (1997) A Branch and Bound Algorithm for the Open Shop Problem. Discrete Applied Mathematics, 76, 43-59.
http://dx.doi.org/10.1016/S0166-218X(96)00116-3
 
[15]Taillard, E. (1993) Benchmarks for Basic Scheduling Problems. European Journal of Operational Research, 64, 278-285. http://dx.doi.org/10.1016/0377-2217(93)90182-M
 
[16]Gueret, C. and Prins, C. (1999) A New Lower Bound for the Open Shop Problems. Annals of Operations Research, 92, 165-183. http://dx.doi.org/10.1023/A:1018930613891
 
[17]Gueret, C., Jussien, N. and Prins, C. (2000) Using Intelligent Backtracking to Improve Branch-and-Bound Methods: An Application to Open-Shop Problems. European Journal of Operational Research, 127, 344-354. http://dx.doi.org/10.1016/S0377-2217(99)00488-9
 
[18]Cheng, T.C.E. and Shakhlevich, N.V. (2007) Two-Machine Open Shop Problem with Controllable Processing Times. Discrete Optimization, 4, 175-184. http://dx.doi.org/10.1016/j.disopt.2006.10.010
 
[19]Jurisch, B. and Kubiak, W. (1997) Two-Machine Open Shops with Renewable Resources. Operations Research, 45, 544-552. http://dx.doi.org/10.1287/opre.45.4.544
 
[20]Lu, L. and Posner, M.E. (1993) An NP-Hard Open Shop Scheduling Problem with Polynomial Average Time Complexity. Mathematics of Operations Research, 18, 12-38.
http://dx.doi.org/10.1287/moor.18.1.12
 
[21]Chen, B. and Strusevich, V.A. (1993) Approximation Algorithms for Three-Machine Open Shop Scheduling. ORSA Journal on Computing, 5, 321-326. http://dx.doi.org/10.1287/ijoc.5.3.321
 
[22]Giaro, K., Kubale, M. and Malafiejski, M. (1999) Compact Scheduling in Open Shop with Zero-One Time Operations. Canadian Journal of Information Systems and Operational Research, 37, 37-47.
 
[23]Drobouchevitch, I.G. and Strusevich, V.A. (1999) A Polynomial Algorithm for the Three-Machine Open Shop with a Bottleneck Machine. Annals of Operations Research, 92, 185-210.
http://dx.doi.org/10.1023/A:1018982630730
 
[24]Kononov, A., Sevastianov, S. and Tchernykh, I. (1999) When Difference in Machine Loads Leads to Efficient Scheduling in Open Shops. Annals of Operations Research, 92, 211-239.
http://dx.doi.org/10.1023/A:1018986731638
 
[25]Rebaine, D. and Strusevich, V.A. (1999) Two-Machine Open Shop Scheduling with Special Trans-portation Times. Journal of the Operational Research Society, 50, 756-764.
http://dx.doi.org/10.1057/palgrave.jors.2600769
 
[26]Gupta, J.N.D. and Werner, F. (1999) On the Solution of 2-Machine Flow and Open Shop Scheduling Problems with Secondary Criteria. 15th ISPE/IEE International Conference on CAD/CAM, Robotics, and Factories of the Future, Aguas De Lindoia, Sao Paulo, 18-20 August 1999.
 
[27]Kyparisis, G.J. and Koulamas, C. (2000) Open Shop Scheduling with Makespan and Total Completion Time Criteria. Computers and Operations Research, 27, 15-27.
http://dx.doi.org/10.1016/S0305-0548(99)00005-2
 
[28]Lorigeon, T., Billaut, J.C. and Bouquard, J.L. (2002) A Dynamic Programming Algorithm for Scheduling Jobs in a Two-Machine Open Shop with an Availability Constraint. Journal of the Operational Research Society, 53, 1239-1246. http://dx.doi.org/10.1057/palgrave.jors.2601421
 
[29]Kononov, A. and Sviridenko, M. (2002) A Linear Time Approximation Scheme for Makespan Minimization in an Open Shop with Release Dates. Operations Research Letters, 30, 276-280.
http://dx.doi.org/10.1016/S0167-6377(02)00115-3
 
[30]Sevastianov, S.V. and Woeginger, G.J. (2001) Linear Time Approximation Scheme for the Multiprocessor Open Shop Problem. Discrete Applied Mathematics, 114, 273-288.
http://dx.doi.org/10.1016/S0166-218X(00)00375-9
 
[31]Murugesan, R., Thamarai, S.S., Rajendran, A.P. and Sampath Kumar, V.S. (2003) Identification of a Rank Minimal Optimal Sequence for Open Shop Scheduling Problems. International Journal of Information and Management Sciences, 14, 37-55.
 
[32]Briet, J., Schmidt, G. and Strusevich, V.A. (2003) Non-Preemptive Two-Machine Open Shop Scheduling with Non-Availability Constraints. Mathematical Methods of Operations Research, 57, 217-234.
http://dx.doi.org/10.1007/s001860200267
 
[33]Gupta, J.N.D., Werner, F. and Wulkenhaar, G. (2003) Two-Machine Open Shop Scheduling with Secondary Criteria. International Transactions in Operational Research, 10, 267-294.
http://dx.doi.org/10.1111/1475-3995.00407
 
[34]Rebaine, D. (2004) Scheduling the Two-Machine Open Shop Problem with Non-Symmetric Time Delays. Congress ASAC, Quebec City, 5-8 June 2004, 1-10.
 
[35]Su, L.H., Chou, F.D. and Ting, W.C. (2005) Minimizing Makespan in a Two-Stage System with Flow Shop and Open Shop. Computers and Industrial Engineering, 49, 520-536.
http://dx.doi.org/10.1016/j.cie.2005.08.001
 
[36]Alcaide, D., Rodriguez-Gonzalez, A. and Sicilia, J. (2006) A Heuristic Approach to Minimize Expected Makespan in Open Shops Subject to Stochastic Processing Times and Failures. International Journal of Flexible Manufacturing Systems, 17, 201-226. http://dx.doi.org/10.1007/s10696-006-8819-1
 
[37]Zhang, X.D. and van de Velde, S. (2010) On-Line Two Machine Open Shop Scheduling with Time Lags. European Journal of Operational Research, 204, 14-19.
http://dx.doi.org/10.1016/j.ejor.2009.09.023
 
[38]Yu, W., Liu, Z., Wang, L. and Fan, T. (2011) Routing Open Shop and Flow Shop Scheduling. European Journal of Operational Research, 213, 24-36. http://dx.doi.org/10.1016/j.ejor.2011.02.028
 
[39]Bai, D. and Tang, L. (2013) Open Shop Scheduling Problem to Minimize Makespan with Release Dates. Applied Mathematical Modelling, 37, 2008-2015. http://dx.doi.org/10.1016/j.apm.2012.04.037
 
[40]Gupta, D., Jain, R. and Singla, P. (2012) Optimal Two Stage Open Shop Scheduling, Processing Time Associated with Probabilities Including Transportation Time and Job Block Criteria. International Journal of Mathematical Archive, 3, 1859-1872.
 
[41]Chung, C.S. and Mohanty, B.B. (1988) Minimizing Expected Makespan in a Two-Machine Stochastic Open Shop with Poisson Arrival. Journal of Mathematical Analysis and Applications, 133, 498-508.
http://dx.doi.org/10.1016/0022-247X(88)90419-2
 
[42]Kubale, M. (1997) Open Shop Problem with Zero-One Time Operations and Integer Release Date/Deadline Intervals. Discrete Applied Mathematics, 76, 213-223.
http://dx.doi.org/10.1016/S0166-218X(96)00126-6
 
[43]Liaw, C.F. (1998) An Iterative Improvement Approach for the Non-Preemptive Open Shop Scheduling Problem. European Journal of Operational Research, 111, 509-517.
http://dx.doi.org/10.1016/S0377-2217(97)00366-4
 
[44]Breit, J., Schmidt, G. and Strusevich, V.A. (2001) Two-Machine Open Shop Scheduling with an Availability Constraint. Operations Research Letters, 29, 65-77.
http://dx.doi.org/10.1016/S0167-6377(01)00079-7
 
[45]Colak, S. and Agarwal, A. (2005) Non-Greedy Heuristics and Augmented Neural Networks for the Open-Shop Scheduling Problem. Naval Research Logistics, 52, 631-644.
 
[46]Kubzin, M.A. and Strusevich, V.A. (2006) Planning Machine Maintenance in Two-Machine Shop Scheduling. Operations Research, 54, 789-800. http://dx.doi.org/10.1287/opre.1060.0301
 
[47]Sedeno-Noda, A., Alcaide, D. and Gonzalez-Martin, C. (2006) Network Flow Approaches to Preemptive Open Shop Scheduling Problems with Time-Windows. European Journal of Operational Research, 174, 1501-1518.
 
[48]Modarres, M. and Ghandehari, M. (2008) Applying Circular Coloring to Open Shop Scheduling. Scientia Iranica, 15, 652-660.
 
[49]Malapert, A., Cambazard, H., Gueret, C., Jusslen, N., Langevin, A. and Rousseau, L.M. (2009) An Optimal Constraint Programming Approach to the Open Shop Problem. Journal of Artificial Intelligence Research, 1, 25-46.
 
[50]Naderi, B., Ghomi Fatemi, S.M.T., Aminnayeri, M. and Zandieh, M. (2010) A Contribution and New Heuristics for the Open Shop Scheduling. Computers & Operations Research, 37, 213-221.
http://dx.doi.org/10.1016/j.cor.2009.04.010
 
[51]Fang, H.L., Ross, P. and Corne, D. (1994) A Promising Hybrid GA/Heuristic Approach for Open-Shop Scheduling Problems. 11th European Conference on Artificial Intelligence, Amsterdam, The Netherlands, 8-12 August 1994, 590-594.
 
[52]Louis, S.J. and Xu, Z.J. (1996) Genetic Algorithms for Open Shop Scheduling and Re-Scheduling. ISCA 11th International Conference on Computers and Their Applications, San Francisco, 7-9 March 1996, 99-102.
 
[53]Khuri, S. and Miryala, S.R. (1999) Genetic Algorithms for Solving Open Shop Scheduling Problems. EPIA ’99 Proceedings of 9th Portuguese Conference on Artificial Intelligence: Progress in Artificial Intelligence, évora, Portugal, 21-24 September 1999, 357-368.
 
[54]Prins, C. (2000) Competitive Genetic Algorithms for the Open Shop Scheduling Problem. Mathematical Methods of Operations Research, 52, 389-411. http://dx.doi.org/10.1007/s001860000090
 
[55]Senthilkumar, P. and Shahabudeen, P. (2006) GA Based Heuristic for the Open Job Shop Scheduling Problem. International Journal of Advanced Manufacturing Technology, 30, 297-301.
http://dx.doi.org/10.1007/s00170-005-0057-2
 
[56]Liaw, C.F. (2000) A Hybrid Genetic Algorithm for the Open Shop Scheduling Problem. European Journal of Operational Research, 124, 28-42. http://dx.doi.org/10.1016/S0377-2217(99)00168-X
 
[57]Zobolas, G.I., Tarantilis, C.D. and Ioannou, G. (2009) Solving the Open Shop Scheduling Problem via a Hybrid Genetic-Variable Neighborhood Search Algorithm. Cybernetics and Systems: An International Journal, 40, 259-285.
http://dx.doi.org/10.1080/01969720902830322
 
[58]Matta, M.E. (2009) A Genetic Algorithm for the Proportionate Multiprocessor Open Shop. Computers & Operations Research, 36, 2601-2618. http://dx.doi.org/10.1016/j.cor.2008.11.009
 
[59]Liaw, C.F. (1999) A Tabu Search Algorithm for the Open Shop Scheduling Problem. Computers and Operations Research, 26, 109-126. http://dx.doi.org/10.1016/S0305-0548(98)00056-2
 
[60]Aguirre-Solis, J.J. (2003) Tabu Search Algorithm for the Open Shop Scheduling Problem with Sequence Dependent Setup Times. Advanced Simulation Technologies Conference, Vol. 1, The Society for Modeling and Simulation International, Orlando, 30 March-3 April 2003.
 
[61]Roshanaei, V., Esfehani, M.M.S. and Zandieh, M. (2010) Integrating Non-Preemptive Open Shop Scheduling with Sequence-Dependent Setup Times Using Advanced Metaheuristics. Expert Systems with Applications, 37, 259-266. http://dx.doi.org/10.1016/j.eswa.2009.05.003
 
[62]Panahi, H. and Tavakkoli-Moghaddam, R. (2011) Solving a Multi-Objective Open Shop Scheduling Problem by a Novel Hybrid Ant Colony Optimization. Expert Systems with Applications, 38, 2817-2822. http://dx.doi.org/10.1016/j.eswa.2010.08.073
 
[63]Chernykh, I., Kononov, A. and Sevastyanov, S. (2013) Efficient Approximation Algorithms for the Routing Open Shop Problem. Computers and Operations Research, 40, 841-847.
http://dx.doi.org/10.1016/j.cor.2012.01.006
 
[64]Huang, Y.M. and Lin, J.C. (2011) A New Bee Colony Optimization Algorithm with Idle-Time-Based Filtering Scheme for Open Shop Scheduling Problems. Expert Systems with Applications, 38, 5438-5447. http://dx.doi.org/10.1016/j.eswa.2010.10.010
 
[65]Sha, D.Y., Lin, H.H. and Hsu, C.Y. (2010) A Modified Particle Swarm Optimization for Multi-Objective Open Shop Scheduling. Proceedings of the International Multi Conference of Engineers and Computer Scientists, 3, 17-19.
 
[66]Liu, S.Q. and Ong, H.L. (2004) Metaheuristics for the Mixed-Shop Scheduling Problem. Asia-Pacific Journal of Operational Research, 21, 97-115. http://dx.doi.org/10.1142/S0217595904000072
 
[67]Blum, C. (2005) Beam-ACO: Hybridizing Ant Colony Optimization with Beam Search: An Application to Open Shop Scheduling. Computers and Operations Research, 32, 1565-1591.
http://dx.doi.org/10.1016/j.cor.2003.11.018
 
[68]Kokosinski, Z. and Studzienny, L. (2007) Hybrid Genetic Algorithms for the Open Shop Scheduling Problem. International Journal of Computer Science and Network Security, 7, 136-145.
 
[69]Modarres, M. and Ghandehari, M. (2008) Generalized Cyclic Open Shop Scheduling and a Hybrid Algorithm. Journal of Industrial and Systems Engineering, 1, 345-359.
 
[70]Dror, M. (1992) Open Shop Scheduling with Machine Dependent Processing Times. Discrete Applied Mathematics, 39, 197-205. http://dx.doi.org/10.1016/0166-218X(92)90176-B
 
[71]Achugbue, J.O. and Chin, F.Y. (1982) Scheduling the Open Shop to Minimize Mean Flow Time. SIAM Journal on Computing, 11, 709-720.
 
[72]Werra, D.D. and Blazewicz, J. (1992) Some Preemptive Open Shop Scheduling Problems with a Renewable or a Nonrenewable Resource. Discrete Applied Mathematics, 35, 205-219.
http://dx.doi.org/10.1016/0166-218X(92)90245-6
 
[73]Tautenhahn, T. (1994) Scheduling Unit-Time Open Shops with Deadlines. Operations Research, 42, 189-192. http://dx.doi.org/10.1287/opre.42.1.189
 
[74]Lin, H.T., Lee, H.T. and Pan, W.J. (2008) Heuristics for Scheduling in a No-Wait Open Shop with Movable Dedicated Machines. International Journal of Production Economics, 111, 368-377.
http://dx.doi.org/10.1016/j.ijpe.2007.01.005
 
[75]Tang, L. and Bai, D. (2010) A New Heuristic for Open Shop Total Completion Time Problem. Applied Mathematical Modelling, 34, 735-743. http://dx.doi.org/10.1016/j.apm.2009.06.014
 
[76]Brasel, H., Herms, A., Morig, M., Tautenhahn, T., Tusch, J. and Werner, F. (2008) Heuristic Constructive Algorithms for Open Shop Scheduling to Minimize Mean Flow Time. European Journal of Operational Research, 189, 856-870. http://dx.doi.org/10.1016/j.ejor.2007.02.057
 
[77]Brasel, H., Kluge, D. and Werner, F. (1995) A Polynomial Algorithm for an Open Shop Problem with Unit Processing Times and Tree Constraints. Discrete Applied Mathematics, 59, 11-21.
http://dx.doi.org/10.1016/0166-218X(93)E0156-S
 
[78]Lann, A., Mosheiov, G. and Rinott, Y. (1998) Asymptotic Optimality in Probability of a Heuristic Schedule for Open Shops with Job Overlaps. Operations Research Letters, 22, 63-68. http://dx.doi.org/10.1016/S0167-6377(98)00007-8
 
[79]Liaw, C.F., Cheng, C.Y. and Chen, M. (2002) The Total Completion Time Open Shop Scheduling Problem with a Given Sequence of Jobs on One Machine. Computers & Operations Research, 29, 1251-1266. http://dx.doi.org/10.1016/S0305-0548(01)00028-4
 
[80]Seraj, O. and Tavakkoli-Moghaddam, R. (2009) A Tabu Search Method for a New Bi-Objective Open Shop Scheduling Problem by a Fuzzy Multi-Objective Decision Making Approach. IJE Transactions, 22, 269-282.
 
[81]Naderi, B., Ghomi Fatemi, S.M.T., Aminnayeri, M. and Zandieh, M. (2011) Scheduling Open Shops with Parallel Machines to Minimize Total Completion Time. Journal of Computational and Applied Mathematics, 235, 1275-1287. http://dx.doi.org/10.1016/j.cam.2010.08.013
 
[82]Andresen, M., Brasel, H., Marc, M., Tusch, J., Werner, F. and Willenius, P. (2008) Simulated Annealing and Genetic Algorithms for Minimizing Mean Flow Time in an Open Shop. Mathematical and Computer Modelling, 48, 1279-1293. http://dx.doi.org/10.1016/j.mcm.2008.01.002
 
[83]Leung, J.Y.T., Li, H., Pinedo, M. and Sriskandarajah, C. (2005) Open Shops with Jobs Overlap—Revisited. European Journal of Operational Research, 163, 569-571.
http://dx.doi.org/10.1016/j.ejor.2003.11.023
 
[84]Gandhi, R., Halldorsson, M.M., Kortsarz, G. and Shachnai, H. (2006) Improved Results for Data Migration and Open Shop Scheduling. ACM Transactions on Algorithms, 2, 116-129.
http://dx.doi.org/10.1145/1125994.1126001
 
[85]Queyranne, M. and Sviridenko, M. (2002) A (2 + ε)-Approximation Algorithm for the Generalized Preemptive Open Shop Problem with Minsum Objective. Journal of Algorithms, 45, 202-212.
http://dx.doi.org/10.1016/S0196-6774(02)00251-1
 
[86]Doulabi, S.H.H., Jaafari, A.A. and Shirazi, M.A. (2010) Minimizing Weighted Mean Flow Time in Open Shop Scheduling with Time-Dependent Weights and Intermediate Storage Cost. International Journal on Computer Science and Engineering, 2, 457-460.
 
[87]Noori-Darvish, S., Mahdavi, I. and Mahdavi-Amiri, N. (2012) A Bi-Objective Possibilistic Programming Model for Open Shop Scheduling Problems with Sequence-Dependent Setup Times, Fuzzy Processing Times and Fuzzy Due Dates. Applied Soft Computing, 12, 1399-1416.
http://dx.doi.org/10.1016/j.asoc.2011.11.019
 
[88]Liu, C.Y. and Bulfin, R.L. (1988) Scheduling Open Shops with Unit Execution Times to Minimize Functions of Due Dates. Operations Research, 36, 553-559. http://dx.doi.org/10.1287/opre.36.4.553
 
[89]Liaw, C.F. (2003) An Efficient Tabu Search Approach for the Two-Machine Preemptive Open Shop Scheduling Problem. Computers and Operations Research, 30, 2081-2095.
http://dx.doi.org/10.1016/S0305-0548(02)00124-7
 
[90]Naderi, B., Ghomi Fatemi, S.M.T., Aminnayeri, M. and Zandieh, M. (2011) A Study on Open Shop Scheduling to Minimize Total Tardiness. International Journal of Production Research, 49, 4657-4678.
http://dx.doi.org/10.1080/00207543.2010.497174
 
[91]Hossein, S. and Doulabi, H. (2010) A Mixed Integer Linear Formulation for the Open Shop Earliness-Tardiness Scheduling Problem. Applied Mathematical Sciences, 4, 1703-1710.
 
[92]Blazewicz, J., Pesch, E., Sterna, M. and Werner, F. (2004) Open Shop Scheduling Problems with Late Work Criteria. Discrete Applied Mathematics, 134, 1-24.
http://dx.doi.org/10.1016/S0166-218X(03)00339-1
 
[93]Andresen, M., Brasel, H., Plauschin, M. and Werner, F. (2008) Using Simulated Annealing for Open Shop Scheduling with Sum Criteria. In: Tan, C.M., Ed., Simulated Annealing, I-Tech Education and Publishing, Vienna, 49-76.http://dx.doi.org/10.5772/5572
 
[94]Ng, C.T., Cheng, T.C.E. and Yuan, J.J. (2003) Concurrent Open Shop Scheduling to Minimize the Weighted Number of Tardy Jobs. Journal of Scheduling, 6, 405-412.
http://dx.doi.org/10.1023/A:1024284828374
 
[95]Cho, Y. and Sahni, S. (1981) Preemptive Scheduling of Independent Jobs with Release and Due Times on Open, Flow and Job Shops. Operations Research, 29, 511-522.
http://dx.doi.org/10.1287/opre.29.3.511
 
[96]Werra, D.D., Mahadev, N.V.R. and Solot, P. (1994) Scheduling Periodic Jobs Compactly within a Fixed Time Period in Open Shops. Canadian Journal of Information Systems and Operational Research, 32, 110-119.
 
[97]Konno, T. and Ishii, H. (2000) An Open Shop Scheduling Problem with Fuzzy Allowable Time and Fuzzy Resource Constraint. Fuzzy Sets and Systems, 109, 141-147.
http://dx.doi.org/10.1016/S0165-0114(97)00380-1
 
[98]Werra, D.D., Hertz, A., Kobler, D. and Mahadev, N.V.R. (2000) Feasible Edge Colorings of Trees with Cardinality Constraints. Discrete Mathematics, 222, 61-72.
http://dx.doi.org/10.1016/S0012-365X(00)00006-6
 
[99]Giaro, K., Kubale, M. and Piwakowski, K. (2002) Complexity Results on Open Shop Scheduling to Minimize Total Cost of Operations. International Journal of Computer System Signal, 3, 84-91.
 
[100]Cheng, T.C.E. and Shakhlevich, N.V. (2005) Minimizing Non-Decreasing Separable Objective Functions for the Unit- Time Open Shop Scheduling. European Journal of Operational Research, 165, 444-456.
http://dx.doi.org/10.1016/j.ejor.2004.04.014
 
[101]Werra, D.D., Kis, T. and Kubiak, W. (2008) Preemptive Open Shop Scheduling with Multiprocessors: Polynomial Cases and Applications. Journal of Scheduling, 11, 75-83.
http://dx.doi.org/10.1007/s10951-007-0050-8                    eww150129lx
标签：

评论

发表评论

此博客中的热门博文

A Comparison of Methods Used to Determine the Oleic/Linoleic Acid Ratio in Cultivated Peanut (Arachis hypogaea L.)

Cultivated peanut ( Arachis hypogaea L.) is an important oil and food crop. It is also a cheap source of protein, a good source of essential vitamins and minerals, and a component of many food products. The fatty acid composition of peanuts has become increasingly important with the realization that oleic acid content significantly affects the development of rancidity. And oil content of peanuts significantly affects flavor and shelf-life. Early generation screening of breeding lines for high oleic acid content greatly increases the efficiency of developing new peanut varieties. The objective of this study was to compare the accuracy of methods used to classify individual peanut seed as high oleic or not high oleic. Three hundred and seventy-four (374) seeds, spanning twenty-three (23) genotypes varying in oil composition (i.e. high oleic (H) or normal/not high oleic (NH) inclusive of all four peanut market-types (runner, Spanish, Valencia and Virginia), were individually tested ...
发表评论
阅读全文

Location Optimization of a Coal Power Plant to Balance Costs against Plant’s Emission Exposure

Fuel and its delivery cost comprise the biggest expense in coal power plant operations. Delivery of electricity from generation to consumers requires investment in power lines and transmission grids. Placing a coal power plant or multiple power plants near dense population centers can lower transmission costs. If a coalmine is nearby, transportation costs can also be reduced. However, emissions from coal plants play a key role in worsening health crises in many countries. And coal upon combustion produces CO 2 , SO 2 , NO x , CO, Metallic and Particle Matter (PM10 & PM2.5). The presence of these chemical compounds in the atmosphere in close vicinity to humans, livestock, and agriculture carries detrimental health consequences. The goal of the research was to develop a methodology to minimize the public’s exposure to harmful emissions from coal power plants while maintaining minimal operational costs related to electric distribution losses and coal logistics. The objective was...
发表评论
阅读全文

Evaluation of the Safety and Efficacy of Continuous Use of a Home-Use High-Frequency Facial Treatment Appliance

At present, many home-use beauty devices are available in the market. In particular, many products developed for facial treatment use light, e.g., a flash lamp or a light-emitting diode (LED). In this study, the safety of 4 weeks’ continuous use of NEWA TM , a high-frequency facial treatment appliance, every alternate day at home was verified, and its efficacy was evaluated in Japanese individuals with healthy skin aged 30 years or older who complained of sagging of the facial skin.  Transepidermal water loss (TEWL), melanin levels, erythema levels, sebum secretion levels, skin color changes and wrinkle improvement in the facial skin were measured before the appliance began to be used (study baseline), at 2 and 4 weeks after it had begun to be used, and at 2 weeks after completion of the 4-week treatment period (6 weeks from the study baseline). In addition, data obtained by subjective evaluation by the subjects themselves on a visual analog scale (VAS) were also analyzed. Fur...
发表评论
阅读全文