Scheduling flow shops with operators

References

• Agnetis, A. , M. Flamini , G. Nicosia , and A. Pacifici . 2011. “A Job-shop Problem with One Additional Resource Type.” Journal of Scheduling 14: 225–237.
   Web of Science ®Google Scholar
• Agrawal, S . 2011. “Minimizing the Elapsed Time with Five Machine Flow Shop Scheduling and Idle Waiting Time Operator.” The IUP Journal of Operations Management 10 (3): 14–26.
   Google Scholar
• Baki, M . 1999. “Some Problems in One-operator Scheduling.” PhD thesis. University of Waterloo.
   Google Scholar
• Baptiste, P. , V. Giard , A. Hait , and F. Soumis . 2005. “Gestion de production et ressources humaines.” Presses Internationales Polytechnique.
   Google Scholar
• Baptiste, P. , and A. Munier . 2013. “Ordonnancement sur machines parallèles avec partage d’opérateurs.” In 10ème Congrès International de Génie Industriel-CIGI 2013, La Rochelle.
   Google Scholar
• Benkalai, I. , P. Baptiste , and D. Rebaine . 2015. “Ordonnancement d’ateliers de type flow shop avec contrainte d’opérateurs.” 11ème Congrès International de Génie Industriel-CIGI 2015, Québec.
   Google Scholar
• Benkalai, I. , P. Baptiste , and D. Rebaine . 2016. “Ordonnancement d’ateliers de type flow shop avec opérateurs en mode d’affectation libre.” 17ème Conférence ROADEF de la Société Française de Recherche Opérationnelle et Aide à la Décision, Compiègne.
   Google Scholar
• Benkalai, I , D Rebaine , and P Baptiste . 2016. “Assigning Operators in a Flow Shop Environment.” In 6th Conference on Information Systems, Logistics and Supply Chain, Bordeaux.
   Google Scholar
• Blazewicz, J , K. Ecker , E. Pesch , G. Schmidt , and J. Weglarz . 2007. Handbook on Scheduling: From Theory to Applications. Springer-Verlag Berlin Heidelberg.
   Google Scholar
• Burns, F. , and J. Rooker . 1976. “Johnson’s Three-machine Flow-shop Conjecture.” Operations Research 24: 578–580.
   Web of Science ®Google Scholar
• Cheng, T. , G. Wang , and C. Sriskandarajah . 1999. “One-operator-two-machine Flowshop Scheduling with Setup and Dismounting Times.” Computers & Operations Research 26: 715–730.
   Web of Science ®Google Scholar
• Cheurfa, M . 2005. “Gestion des ressources humaines en production cyclique.” PhD thesis. ENSM Saint-Étienne.
   Google Scholar
• Farber, G. , S. Salhi , and A. C. Moreno . 2007. “Sequencing in a Non-permutation Flow Shop with Constrained Buffers: Applicability of Genetic Algorithm versus Constraint Logic Programming.” In XI Congreso de Ingenierìa de Organizaciòn : International Conference on Industrial Engineering and Industrial Management, Madrid.
   Google Scholar
• Garey, M. , and D. Johnson . 1979. Computers and Intractability: A Guide to the Theory of NP-completeness. New York: W. H. Freeman and Company.
   Google Scholar
• Graham, R. L. 1969. “Bounds on Multiprocessor Timing Anomalies.” SIAM Journal of Applied Mathmatics 17: 416–429.
   Web of Science ®Google Scholar
• Gupta, J. , and E. Stafford . 2006. “Flowshop Scheduling Research after Five Decades.” European Journal of Operational Research 169: 699–711.
   Web of Science ®Google Scholar
• Hall, N. , C. Potts , and C. Sriskandarajah . 2000. “Parallel Machine Scheduling with a Common Server.” Discrete Applied Mathematics 102: 223–243.
   Web of Science ®Google Scholar
• Johnson, S. 1954. “Optimal Two and Three-stage Production Schedules with Setup Times Included.” Naval research logistics quarterly 1 (1): 61–68.
   Google Scholar
• Koulamas, C. 1998. “A New Constructive Heuristic for the Flowshop Scheduling Problem.” European Journal of Operational Research 105: 66–71.
   Web of Science ®Google Scholar
• Lee, I.-S. 1991. “A Worst-case Performance of the Shortest-processing-time Heuristic for Single Machine Scheduling.” The Journal of the Operational Research Society 42 (10): 895–901.
   Web of Science ®Google Scholar
• Li, X. , M. F. Baki , and Y. P. Aneja . 1995. “Flow Shop Scheduling to Minimize the Total Completion Time with a Permanently Present Operator: Models and Ant Colony Optimization Metaheuristic.” Computers and Operations Research 38: 152–164.
   Web of Science ®Google Scholar
• Liao, C. J. , L. M. Liao , and C. T. Tseng . 2007. “A Performance Evaluation of Permutation vs.” Non-permutation Schedules in a Flowshop, International Journal of Production Research 44 (20): 4297–4309.
   Web of Science ®Google Scholar
• Nawaz, M. , E. J. Enscore , and I. Ham . 1983. “A Heuristic Algorithm for the m-machine n-job Flow-shop Sequencing Problem, Omega.” The International Journal of Management Science 11: 91–95.
   Web of Science ®Google Scholar
• Neubert, G. , and M. Savino . 2009. “Flow Shop Operator Scheduling through Constraint Satisfaction and Constraint Optimisation Techniques.” International Journal of Productivity and Quality Management 4 (5/6): 549–568.
   Google Scholar
• NoorulHaq, A. , M. Saravanan , A. Vivekraj , and T. Prasad . 2007. “A scatter Search Approach for General Flowshop Scheduling Problem.” International Journal of Advanced Manufacturing Technology 31: 731–736.
   Web of Science ®Google Scholar
• Potts, C. , D. Shmoys , and D. Williamson . 1991. “Permutation vs.” Non-permutation Flowshop Schedules, Operations Research Letters 10: 281–284.
   Web of Science ®Google Scholar
• Ruiz, R. , M. Concepción , and J. Alcaraz . 2004. “Solving the Flowshop Scheduling Problem with Sequence Dependent Setup Times Using Advanced Metaheuristics.” European Journal of Operational Research 217: 34–54.
   Google Scholar
• Vahedi-Nouri, B. , P. Fattahi , and R. Ramezanian . 2013. “Minimizing Total Flow Time for the Non-permutation Flow Shop Scheduling Problem with Learning Effects and Availability Constraints.” Journal of Manufacturing Systems 32: 167–173.
   Web of Science ®Google Scholar
• Vickson, R. 1980a. “Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine.” Operations Research 28 (5): 1155–1167.
   Web of Science ®Google Scholar
• Vickson, R. 1980b. “Two single machine sequencing Problems Involving Controllable Job Processing Times.” AIIE transactions 12 (3): 258–262.
   Web of Science ®Google Scholar
• Ying, K.-C. , J. Gupta , S.-W. Lin , and Z.-J. Lee . 2010. “Permutation and Non-permutation Schedules for the Flowline Manufacturing Cell with Sequence Dependent Family Setups.” International Journal of Production Research 48 (8): 2169–2184.
   Web of Science ®Google Scholar
• Ying, K.-C. , and S.-W. Lin . 2007. “Multi-heuristic Desirability Ant Colony System Heuristic for Non-permutation Flowshop Scheduling Problems.” International Journal of Advanced Manufacturing Technology 33: 793–802.
   Web of Science ®Google Scholar
• Ziaee, M. , and S. Sadjadi . 2007. “Mixed Binary Integer Programming Formulations for the Flow Shop Scheduling Problems.” A Case Study: ISD Projects Scheduling, Applied Mathematics and Computation 185: 218–228.
   Web of Science ®Google Scholar
• Zouba, M . 2009. “Ordonnancement de machines parallèles identiques avec des contraintes de ressources humaines.” PhD thesis. École Polytechnique Montréal.
   Google Scholar