226
Views
131
CrossRef citations to date
0
Altmetric
Original Articles

Heuristics for flow-shop scheduling

&
Pages 345-357 | Received 16 May 1979, Published online: 25 Apr 2007

Keep up to date with the latest research on this topic with citation updates for this article.

Read on this site (31)

Fernando Siqueira de Almeida & Marcelo Seido Nagano. (2023) Heuristics to optimize total completion time subject to makespan in no-wait flow shops with sequence-dependent setup times. Journal of the Operational Research Society 74:1, pages 362-373.
Read now
Marcelo Seido Nagano, Fernando Siqueira de Almeida & Hugo Hissashi Miyata. (2021) An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time. Engineering Optimization 53:8, pages 1431-1449.
Read now
Hamed Samarghandi. (2015) A particle swarm optimisation for the no-wait flow shop problem with due date constraints. International Journal of Production Research 53:9, pages 2853-2870.
Read now
Hamed Samarghandi. (2015) Studying the effect of server side-constraints on the makespan of the no-wait flow-shop problem with sequence-dependent set-up times. International Journal of Production Research 53:9, pages 2652-2673.
Read now
Dipak Laha, Jatinder N D Gupta & Sagar U Sapkal. (2014) A penalty-shift-insertion-based algorithm to minimize total flow time in no-wait flow shops. Journal of the Operational Research Society 65:10, pages 1611-1624.
Read now
B. Naderi, Majid Khalili & Alireza Arshadi Khamseh. (2014) Mathematical models and a hunting search algorithm for the no-wait flowshop scheduling with parallel machines. International Journal of Production Research 52:9, pages 2667-2681.
Read now
Hamed Samarghandi & Tarek Y. ElMekkawy. (2014) Solving the no-wait flow-shop problem with sequence-dependent set-up times. International Journal of Computer Integrated Manufacturing 27:3, pages 213-228.
Read now
Nazanin Moradinasab, Rasoul Shafaei, Meysam Rabiee & Pezhman Ramezani. (2013) No-wait two stage hybrid flow shop scheduling with genetic and adaptive imperialist competitive algorithms. Journal of Experimental & Theoretical Artificial Intelligence 25:2, pages 207-225.
Read now
Hamed Samarghandi & Tarek Y. ElMekkawy. (2012) A meta-heuristic approach for solving the no-wait flow-shop problem. International Journal of Production Research 50:24, pages 7313-7326.
Read now
B. Naderi, M. Aminnayeri, M. Piri & M.H. Ha'iri Yazdi. (2012) Multi-objective no-wait flowshop scheduling problems: models and algorithms. International Journal of Production Research 50:10, pages 2592-2608.
Read now
Hadi Mokhtari, Isa Nakhai Kamal Abadi & Ali Cheraghalikhani. (2011) A multi-objective flow shop scheduling with resource-dependent processing times: trade-off between makespan and cost of resources. International Journal of Production Research 49:19, pages 5851-5875.
Read now
R. Shafaei, M. Rabiee & M. Mirzaeyan. (2011) An adaptive neuro fuzzy inference system for makespan estimation in multiprocessor no-wait two stage flow shop. International Journal of Computer Integrated Manufacturing 24:10, pages 888-899.
Read now
Orhan Engin & Cengiz Günaydin. (2011) An adaptive learning approach for no-wait flowshop scheduling problems to minimize makespan. International Journal of Computational Intelligence Systems 4:4, pages 521-529.
Read now
Wei Li, Xinggang Luo, Deyi Xue & Yiliu Tu. (2011) A heuristic for adaptive production scheduling and control in flow shop production. International Journal of Production Research 49:11, pages 3151-3170.
Read now
Rubén Ruiz & Ali Allahverdi. (2009) New heuristics for no-wait flow shops with a linear combination of makespan and maximum lateness. International Journal of Production Research 47:20, pages 5717-5738.
Read now
R. Rajkumar & P. Shahabudeen. (2009) Bi-criteria improved genetic algorithm for scheduling in flowshops to minimise makespan and total flowtime of jobs. International Journal of Computer Integrated Manufacturing 22:10, pages 987-998.
Read now
S.-W. Lin & K.-C. Ying. (2009) Applying a hybrid simulated annealing and tabu search approach to non-permutation flowshop scheduling problems. International Journal of Production Research 47:5, pages 1411-1424.
Read now
Xiaoping Li, Qian Wang & Cheng Wu. (2008) Heuristic for no-wait flow shops with makespan minimization. International Journal of Production Research 46:9, pages 2519-2530.
Read now
M. Hossein Fazel Zarandi, M. Mehdi Fazel Zarandi, M. Yousef Maknoon & J. Masoumi. (2007) Scheduling of two and three machine robotic cells with fuzzy methodology. International Journal of Management Science and Engineering Management 2:4, pages 243-256.
Read now
S. Reza Hejazi & S. Saghafian. (2005) Flowshop-scheduling problems with makespan criterion: a review. International Journal of Production Research 43:14, pages 2895-2929.
Read now
J M Framinan, J N D Gupta & R Leisten. (2004) A review and classification of heuristics for permutation flow-shop scheduling with makespan objective. Journal of the Operational Research Society 55:12, pages 1243-1255.
Read now
Hui-Chin Tang. (2002) Experimental comparison of heuristics for flow shop scheduling. Journal of Information and Optimization Sciences 23:2, pages 313-321.
Read now
M. M. DESSOUKY, S. ADIGA & K. PARK. (1995) Design and scheduling of flexible assembly lines for printed circuit boards. International Journal of Production Research 33:3, pages 757-775.
Read now
C. RAJENDRAN. (1994) A heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria. International Journal of Production Research 32:11, pages 2541-2558.
Read now
Henri Pierreval. (1993) Neural Network to Select Dynamic Scheduling Heuristics. Journal of Decision Systems 2:2, pages 173-190.
Read now
URBAN WEMMERLÖV & ASOOJ. VAKHARIA. (1991) Job and Family Scheduling of a Flow-Line Manufacturing Cell: A Simulation Study. IIE Transactions 23:4, pages 383-393.
Read now
SAMEERC. JHAVERI & BOBBIEL. FOOTE. (1991) A heuristic algorithm to schedule work in the repair industry. International Journal of Production Research 29:12, pages 2393-2405.
Read now
RAINER LEISTEN. (1990) Flowshop sequencing problems with limited buffer storage. International Journal of Production Research 28:11, pages 2085-2100.
Read now
VALERIO GRASSO. (1990) AGV-served assembly lines: influence of sequencing and launch policies on system performances. International Journal of Production Research 28:7, pages 1385-1399.
Read now
TEJPALS. HUNDAL & JAYANT RAJGOPAL. (1988) An extension of Palmer's heuristic for the flow shop scheduling problem. International Journal of Production Research 26:6, pages 1119-1124.
Read now

Articles from other publishers (100)

E. Janaki & A. Mohamed Ismail. (2023) Using the genetic algorithm to reduce tardiness by tightening the deadline date for stochastic processing. Soft Computing.
Crossref
Alessandro Bozzi, Simone Graffione, José Jiménez, Roberto Sacile & Enrico Zero. (2023) Reliability Evaluation of Emergent Behaviour in a Flexible Manufacturing Problem. Reliability Evaluation of Emergent Behaviour in a Flexible Manufacturing Problem.
Yu Gao, Ziyue Wang, Liang Gao & Xinyu Li. (2022) A Matheuristic Approach for the No-Wait Flowshop Scheduling Problem with Makespan Criterion. Symmetry 14:5, pages 913.
Crossref
Jose M. Framinan & Rainer Leisten. (2019) Linking Scheduling Criteria to Shop Floor Performance in Permutation Flowshops. Algorithms 12:12, pages 263.
Crossref
Andreas Hipp & Victor Fernandez-Viagas. (2019) Influence of no-wait and time lag constraints in flowshop scheduling systems. Influence of no-wait and time lag constraints in flowshop scheduling systems.
Kathrin Maassen, Andreas Hipp & Paz Perez-Gonzalez. (2019) Constructive heuristics for the minimization of core waiting time in permutation flow shop problems. Constructive heuristics for the minimization of core waiting time in permutation flow shop problems.
Omar Bougacha, Christophe Varnier, Noureddine Zerhouni & Sonia Hajri-Gabouj. (2019) Integrated Production and Predictive Maintenance Planning based on Prognostic Information. Integrated Production and Predictive Maintenance Planning based on Prognostic Information.
Orhan Engin & Abdullah Güçlü. (2018) A new hybrid ant colony optimization algorithm for solving the no-wait flow shop scheduling problems. Applied Soft Computing 72, pages 166-176.
Crossref
Chiwen Qu, Yanming Fu, Zhongjun Yi & Jun Tan. (2018) Solutions to No-Wait Flow Shop Scheduling Problem Using the Flower Pollination Algorithm Based on the Hormone Modulation Mechanism. Complexity 2018, pages 1-18.
Crossref
Honghan Ye, Wei Li & Amin Abedini. (2017) An improved heuristic for no-wait flow shop to minimize makespan. Journal of Manufacturing Systems 44, pages 273-279.
Crossref
Hamed Samarghandi & Mehdi Behroozi. (2017) On the exact solution of the no-wait flow shop problem with due date constraints. Computers & Operations Research 81, pages 141-159.
Crossref
Shih-Wei Lin & Kuo-Ching Ying. (2016) Optimization of makespan for no-wait flowshop scheduling problems using efficient matheuristics. Omega 64, pages 115-125.
Crossref
Dipak Laha & Jatinder N.D. Gupta. (2016) A Hungarian penalty-based construction algorithm to minimize makespan and total flow time in no-wait flow shops. Computers & Industrial Engineering 98, pages 373-383.
Crossref
Arun Gupta & Shailendra Kumar. (2016) Flow shop scheduling decisions through Techniques for Order Preference by Similarity to an Ideal Solution (TOPSIS). International Journal of Production Management and Engineering 4:2, pages 43.
Crossref
Honghan Ye, Wei Li & Enming Miao. (2016) An effective heuristic for no-wait flow shop production to minimize makespan. Journal of Manufacturing Systems 40, pages 2-7.
Crossref
Kewal Krishan Nailwal, Deepak Gupta & Sameer Sharma. (2016) Minimizing makespan in flow shop under no-wait restriction on jobs. Minimizing makespan in flow shop under no-wait restriction on jobs.
Guanlong Deng, Ming Wei, Qingtang Su & Mei Zhao. (2015) An effective co-evolutionary quantum genetic algorithm for the no-wait flow shop scheduling problem. Advances in Mechanical Engineering 7:12, pages 168781401562290.
Crossref
Xia Zhu & Xiaoping Li. (2014) Iterative search method for total flowtime minimization no-wait flowshop problem. International Journal of Machine Learning and Cybernetics 6:5, pages 747-761.
Crossref
Jian-Ya Ding, Shiji Song, Jatinder N.D. Gupta, Rui Zhang, Raymond Chiong & Cheng Wu. (2015) An improved iterated greedy algorithm with a Tabu-based reconstruction strategy for the no-wait flowshop scheduling problem. Applied Soft Computing 30, pages 604-613.
Crossref
Jianya Ding, Shiji Song, Rui Zhang & Cheng Wu. (2014) Minimizing makespan for a no-wait flowshop using tabu mechanism improved iterated greedy algorithm. Minimizing makespan for a no-wait flowshop using tabu mechanism improved iterated greedy algorithm.
Chuyang Wang. (2014) Fast iterated local search algorithm with high order neighborhood for no-wait flowshop scheduling problem. Fast iterated local search algorithm with high order neighborhood for no-wait flowshop scheduling problem.
Dipak Laha & Sagar U Sapkal. (2014) An improved heuristic to minimize total flow time for scheduling in the m-machine no-wait flow shop. Computers & Industrial Engineering 67, pages 36-43.
Crossref
Deepak Gupta, Kewal Krishan Nailwal & Sameer Sharma. 2014. Proceedings of the Third International Conference on Soft Computing for Problem Solving. Proceedings of the Third International Conference on Soft Computing for Problem Solving 423 432 .
IMRAN ALI CHAUDHRY & ABDUL MUNEM KHAN. (2013) Minimizing makespan for a no-wait flowshop using genetic algorithm. Sadhana 37:6, pages 695-707.
Crossref
Harun Aydilek & Ali Allahverdi. (2012) Heuristics for no-wait flowshops with makespan subject to mean completion time. Applied Mathematics and Computation 219:1, pages 351-359.
Crossref
R. Pugazhenthi & M. Anthony Xavior. 2012. Emerging Trends in Science, Engineering and Technology. Emerging Trends in Science, Engineering and Technology 343 350 .
Q. Q. Sun, K. Z. Gao & H. Q. Li. (2011) A heuristic for the no-wait flow shop scheduling optimization. A heuristic for the no-wait flow shop scheduling optimization.
Xia Zhu, Xiaoping Li & Qian Wang. (2011) An evolutionary algorithm for no-wait flowshop problems with flowtime minimization. An evolutionary algorithm for no-wait flowshop problems with flowtime minimization.
Sagar U. Sapkal & Dipak Laha. (2011) An improved scheduling heuristic algorithm for no-wait flow shops on total flow time criterion. An improved scheduling heuristic algorithm for no-wait flow shops on total flow time criterion.
Wei Li, Barrie R. Nault, Deyi Xue & Yiliu Tu. (2011) An efficient heuristic for adaptive production scheduling and control in one-of-a-kind production. Computers & Operations Research 38:1, pages 267-276.
Crossref
Yiliu Tu & Paul DeanYiliu Tu & Paul Dean. 2011. One-of-a-Kind Production. One-of-a-Kind Production 169 213 .
Lin-Yu Tseng & Ya-Tai Lin. (2010) A hybrid genetic algorithm for no-wait flowshop scheduling problem. International Journal of Production Economics 128:1, pages 144-152.
Crossref
Chuyang Wang, Xiaoping Li & Qian Wang. (2010) Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion. European Journal of Operational Research 206:1, pages 64-72.
Crossref
Quan-Ke Pan, Ling Wang & Bin Qian. (2009) A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems. Computers & Operations Research 36:8, pages 2498-2511.
Crossref
Zong-you Hong & Ha-li Pang. (2009) Heuristic algorithm based on the Crucial Machine for the No-Wait Flow-shop scheduling. Heuristic algorithm based on the Crucial Machine for the No-Wait Flow-shop scheduling.
Uday K. Chakraborty. (2009) Minimizing total flow time in permutation flow shop scheduling with improved simulated annealing. Minimizing total flow time in permutation flow shop scheduling with improved simulated annealing.
Shahriar Farahmand Rad, Rubén Ruiz & Naser Boroojerdian. (2009) New high performing heuristics for minimizing makespan in permutation flowshops. Omega 37:2, pages 331-345.
Crossref
Pawel J. Kalczynski & Jerzy Kamburowski. (2008) An improved NEH heuristic to minimize makespan in permutation flow shops. Computers & Operations Research 35:9, pages 3001-3008.
Crossref
Quan-Ke Pan, M. Fatih Tasgetiren & Yun-Chia Liang. (2008) A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem. Computers & Operations Research 35:9, pages 2807-2839.
Crossref
Marcelo Seido Nagano, Rubén Ruiz & Luiz Antonio Nogueira Lorena. (2008) A Constructive Genetic Algorithm for permutation flowshop scheduling. Computers & Industrial Engineering 55:1, pages 195-207.
Crossref
Kuo-Ching Ying. (2007) Solving non-permutation flowshop scheduling problems by an effective iterated greedy heuristic. The International Journal of Advanced Manufacturing Technology 38:3-4, pages 348-354.
Crossref
Xia Zhu, Xiaoping Li & Qian Wang. (2008) Objective increment based hybrid GA for no-wait flowshops. Objective increment based hybrid GA for no-wait flowshops.
Quan-Ke Pan, Fatih Tasgetiren, Yun-Chia Liang & P. N. Suganthan. (2008) Upper bounds on Taillard’s benchmark suite for the no-wait flowshop scheduling problem with makespan criterion. Upper bounds on Taillard’s benchmark suite for the no-wait flowshop scheduling problem with makespan criterion.
Q-K Pan, L Wang & Qian B. (2008) A novel multi-objective particle swarm optimization algorithm for no-wait flow shop scheduling problems. Proceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture 222:4, pages 519-539.
Crossref
Chuyang Wang, Xiaoping Li & Qian Wang. (2008) Iterative local search algorithm for no-wait flowshop scheduling problems to minimize makespan. Iterative local search algorithm for no-wait flowshop scheduling problems to minimize makespan.
Jose M. Framinan & Marcelo S. Nagano. (2008) Evaluating the performance for makespan minimisation in no-wait flowshop sequencing. Journal of Materials Processing Technology 197:1-3, pages 1-9.
Crossref
W. P. Wang. (2007) Scheduling performance evaluation in hybrid production environments. Scheduling performance evaluation in hybrid production environments.
Rubén Ruiz & Ali Allahverdi. (2007) Some effective heuristics for no-wait flowshops with setup times to minimize total completion time. Annals of Operations Research 156:1, pages 143-171.
Crossref
Kuo-Ching Ying & Shih-Wei Lin. (2006) Multi-heuristic desirability ant colony system heuristic for non-permutation flowshop scheduling problems. The International Journal of Advanced Manufacturing Technology 33:7-8, pages 793-802.
Crossref
M. Fatih Tasgetiren, Quan-Ke Pan, P. N. Suganthan & Yun-Chia Liang. (2007) A Discrete Differential Evolution Algorithm for the No-Wait Flowshop Scheduling Problem with Total Flowtime Criterion. A Discrete Differential Evolution Algorithm for the No-Wait Flowshop Scheduling Problem with Total Flowtime Criterion.
Xia Zhu, Xiaoping Li & Qian Wang. (2007) Hybrid Heuristic for Total Flowtime Minimization in No-wait Flow Shops. Hybrid Heuristic for Total Flowtime Minimization in No-wait Flow Shops.
Xiaoping Li, Qian Wang & Cheng Wu. (2006) An Efficient Method for No-Wait Flow Shop Scheduling to Minimize Makespan. An Efficient Method for No-Wait Flow Shop Scheduling to Minimize Makespan.
Tapan P. Bagchi, Jatinder N.D. Gupta & Chelliah Sriskandarajah. (2006) A review of TSP based approaches for flowshop scheduling. European Journal of Operational Research 169:3, pages 816-854.
Crossref
Jatinder N.D. Gupta, Christos Koulamas & George J. Kyparisis. (2006) Performance guarantees for flowshop heuristics to minimize makespan. European Journal of Operational Research 169:3, pages 865-872.
Crossref
Rubén Ruiz & Concepción Maroto. (2005) A comprehensive review and evaluation of permutation flowshop heuristics. European Journal of Operational Research 165:2, pages 479-494.
Crossref
Józef Grabowski & Jarosław Pempera. (2005) Some local search algorithms for no-wait flow-shop problem with makespan criterion. Computers & Operations Research 32:8, pages 2197-2212.
Crossref
Ibrahim M. Al-Harkan. (2005) New Heuristics to Minimize the Mean Flow Time for Static Permutation Flowshop Problems. Journal of King Saud University - Engineering Sciences 18:1, pages 83-98.
Crossref
Ali Allahverdi & Tariq Aldowaisan. (2004) No-wait flowshops with bicriteria of makespan and maximum lateness. European Journal of Operational Research 152:1, pages 132-147.
Crossref
Andreas Fink & Stefan Voß. (2003) Solving the continuous flow-shop scheduling problem by metaheuristics. European Journal of Operational Research 151:2, pages 400-414.
Crossref
Tariq Aldowaisan & Ali Allahverdi. (2003) New heuristics for no-wait flowshops to minimize makespan. Computers & Operations Research 30:8, pages 1219-1231.
Crossref
Edy Bertolissi. (2000) Heuristic algorithm for scheduling in the no-wait flow-shop. Journal of Materials Processing Technology 107:1-3, pages 459-465.
Crossref
Sukran N. Kadipasaoglu & V. Sridharan. 2000. Wiley Encyclopedia of Electrical and Electronics Engineering. Wiley Encyclopedia of Electrical and Electronics Engineering.
Chandrasekharan Rajendran & Hans Ziegler. (1999) Heuristics for scheduling in flowshops and flowline-based manufacturing cells to minimize the sum of weighted flowtime and weighted tardiness of jobs. Computers & Industrial Engineering 37:4, pages 671-690.
Crossref
Bryan A Norman. (1999) Scheduling flowshops with finite buffers and sequence-dependent setup times. Computers & Industrial Engineering 36:1, pages 163-177.
Crossref
I. B. Türkşen & M. H. Fazel Zarandi. 1999. Practical Applications of Fuzzy Technologies. Practical Applications of Fuzzy Technologies 479 529 .
Czesław Smutnicki. (1998) Some results of the worst-case analysis for flow shop scheduling. European Journal of Operational Research 109:1, pages 66-87.
Crossref
Christos Koulamas. (1998) A new constructive heuristic for the flowshop scheduling problem. European Journal of Operational Research 105:1, pages 66-71.
Crossref
Chandrasekharan Rajendran & Hans Ziegler. (1997) An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs. European Journal of Operational Research 103:1, pages 129-138.
Crossref
Vladimir Bourgade. (1997) Real Time No-Wait In-Process Scheduling Flowshop Problems in Uncertain Environment. IFAC Proceedings Volumes 30:19, pages 289-294.
Crossref
E. Bonjour, P. Baptiste & D. Larcheveque. (1997) Data quality and flowshop scheduling results. Data quality and flowshop scheduling results.
Wolfgang Domschke, Armin Scholl & Stefan VoßWolfgang Domschke, Armin Scholl & Stefan Voß. 1997. Produktionsplanung. Produktionsplanung 279 446 .
Yeong-Dae Kim, Hyeong-Gyu Lim & Moon-Won Park. (1996) Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process. European Journal of Operational Research 91:1, pages 124-143.
Crossref
M. G. Zentner & Gintaras V. Reklaitis. 1996. Batch Processing Systems Engineering. Batch Processing Systems Engineering 779 807 .
Chengbin Chu, Jean-Marie Proth & Suresh Sethi. (1995) Heuristic procedures for minimizing makespan and the number of required pallets. European Journal of Operational Research 86:3, pages 491-502.
Crossref
Chandrasekharan Rajendran. (1995) Heuristics for scheduling in flowshop with multiple objectives. European Journal of Operational Research 82:3, pages 540-555.
Crossref
Gerhard GeorgiGerhard Georgi. 1995. Job Shop Scheduling in der Produktion. Job Shop Scheduling in der Produktion 103 150 .
M. Bolognini, R. Borelli, Q. Semeraro & T. Tolio. (1994) Influence of the structure of a static permutatino flowshop problem on the performance of single shot heuristics. Computers & Industrial Engineering 26:3, pages 437-450.
Crossref
Rajesh Gangadharan & Chandrasekharan Rajendran. (1993) Heuristic algorithms for scheduling in the no-wait flowshop. International Journal of Production Economics 32:3, pages 285-290.
Crossref
Chandrasekharan Rajendran. (1993) Heuristic algorithm for scheduling in a flowshop to minimize total flowtime. International Journal of Production Economics 29:1, pages 65-73.
Crossref
Wolfgang Domschke, Armin Scholl & Stefan VoßWolfgang Domschke, Armin Scholl & Stefan Voß. 1993. Produktionsplanung. Produktionsplanung 249 410 .
F. Werner. (1991) On the combinatorial structure of the permutation flow shop problem. ZOR Zeitschrift f� Operations Research Methods and Models of Operations Research 35:4, pages 273-289.
Crossref
Johnny C. Ho & Yih-Long Chang. (1991) A new heuristic for the n-job, M-machine flow-shop problem. European Journal of Operational Research 52:2, pages 194-202.
Crossref
Ding-Yu Chan. 1991. Advances in Production Management Systems. Advances in Production Management Systems 567 574 .
Taeho Park & Harold J. Steudel. (1991) Analysis of heuristics for job sequencing in manufacturing flow line work-cells. Computers & Industrial Engineering 20:1, pages 129-140.
Crossref
Wenxue Han & Pierre Dejax. (2011) Une heuristique pour le problème d’ordonnancement de type $n/m//F/C_{\text{max}}$ avec la présence de machines goulots. RAIRO - Operations Research 24:4, pages 315-330.
Crossref
K. PRESTON WHITEJR.JR.. 1990. Advances in Industrial Systems. Advances in Industrial Systems 115 157 .
Taehee Lee. (1990) New jobs regeneration methods for computer integrated manufacturing environment. Computers & Industrial Engineering 19:1-4, pages 32-36.
Crossref
Stelios H. Zanakis, James R. Evans & Alkis A. Vazacopoulos. (1989) Heuristic methods and applications: A categorized survey. European Journal of Operational Research 43:1, pages 88-110.
Crossref
Byung‐Suh Kang & Robert E. Markland. (1989) Technical Paper: Solving the No‐intermediate Storage Flowshop Scheduling Problem. International Journal of Operations & Production Management 9:3, pages 48-59.
Crossref
V. Grasso, A. Masnata & M. Piacentini. 1989. Current Advances in Mechanical Design & Production IV. Current Advances in Mechanical Design & Production IV 629 636 .
George H. Abdou & Samir B. Billatos. (1989) Simulation and optimization of tool-life in manufacturing centers. Journal of Intelligent and Robotic Systems 2:1, pages 73-89.
Crossref
F.A. Rodammer & K.P. White. (1988) A recent survey of production scheduling. IEEE Transactions on Systems, Man, and Cybernetics 18:6, pages 841-851.
Crossref
Taehee Lee. (1988) An integrated scheduler for manufacturing planning and control (INSCH). Computers & Industrial Engineering 15:1-4, pages 139-145.
Crossref
R.C. Mishra, P.C. Pandey & J.L. Gaindhar. (1988) Multi-product flowshop scheduling with ordered processing times. Computers & Industrial Engineering 14:3, pages 361-364.
Crossref
Robert T. Barrett & Samir Barman. (2016) A SLAM II simulation study of a simplified flow shop. SIMULATION 47:5, pages 181-189.
Crossref
C.R. Woollam. (1986) Flowshop with no idle machine time allowed. Computers & Industrial Engineering 10:1, pages 69-76.
Crossref
C. White. (1985) Production scheduling with applications in the printing industry. European Journal of Operational Research 22:3, pages 304-309.
Crossref
C.R. Woollam & N. Sambandam. (1985) The flow shop problem with a composite cost function. Computers & Industrial Engineering 9:1, pages 83-89.
Crossref
R. BELLMAN, A.O. ESOGBUE & I. NABESHIMA. 1982. Mathematical Aspects of Scheduling and Applications. Mathematical Aspects of Scheduling and Applications 235 257 .
Malcolm McKenzie Park. (1990) Flowshop Sequencing: A Graphical Approach. SSRN Electronic Journal.
Crossref

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:

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:

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.