Search results for "flowshops"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
78	Xia Zhu, Xiaoping Li 0001, Qian Wang 0011	Hybrid Heuristic for m-Machine No-Wait Flowshops to Minimize Total Completion Time.	CSCWD (Selected Papers)	2007	DBLP DOI BibTeX RDF	Flowshop scheduling, No-wait, Total completion time, Hybrid Heuristics
51	Joanna Jedrzejowicz, Piotr Jedrzejowicz	Population-Based Approach to Multiprocessor Task Scheduling in Multistage Hybrid Flowshops.	KES	2003	DBLP DOI BibTeX RDF
46	Baruch Mor, Dana Shapira	Scheduling problems on a new setting of flexible flowshops: ℓ-Machine proportionate flowshops.	J. Oper. Res. Soc.	2022	DBLP DOI BibTeX RDF
36	Dinah W. Cheng, Rhonda Righter	On the order of tandem queues.	Queueing Syst. Theory Appl.	1995	DBLP DOI BibTeX RDF	optimal order of servers, reversed hazard rate, coupling arguments, Tandem queues, stochastic ordering, flowshops
28	Feng Jin, Jatinder N. D. Gupta, Shiji Song, Cheng Wu	Makespan distribution of permutation flowshop schedules.	J. Sched.	2008	DBLP DOI BibTeX RDF	Permutation flowshop scheduling problem (PFSP), Makespan distribution, Job-dominated and machine-dominated PFSPs
23	Guangwei Wu, Fu Zuo, Feng Shi 0003, Jian-Xin Wang 0001	On scheduling multiple parallel two-stage flowshops with Johnson's Rule.	J. Comb. Optim.	2024	DBLP DOI BibTeX RDF
23	Zhen Lin, Xue-Lei Jing, Baoxian Jia	An iterated greedy algorithm for distributed flowshops with tardiness and rejection costs to maximize total profit.	Expert Syst. Appl.	2023	DBLP DOI BibTeX RDF
23	Pourya Pourhejazy, Chen-Yang Cheng, Kuo-Ching Ying, Nguyen Hoai Nam	Meta-Lamarckian-based iterated greedy for optimizing distributed two-stage assembly flowshops with mixed setups.	Ann. Oper. Res.	2023	DBLP DOI BibTeX RDF
23	Guangwei Wu, Fu Zuo, Feng Shi 0003, Jianxin Wang 0001	Applying Johnson's Rule in Scheduling Multiple Parallel Two-Stage Flowshops.	IJTCS-FAW	2023	DBLP DOI BibTeX RDF
23	Jianer Chen, Minjie Huang, Yin Guo	Scheduling multiple two-stage flowshops with a deadline.	Theor. Comput. Sci.	2022	DBLP DOI BibTeX RDF
23	Weitian Tong, Yao Xu, Huili Zhang	A polynomial-time approximation scheme for parallel two-stage flowshops under makespan constraint.	Theor. Comput. Sci.	2022	DBLP DOI BibTeX RDF
23	Weitian Tong, Yao Xu, Huili Zhang	A PTAS for parallel two-stage flowshops under makespan constraint.	CoRR	2022	DBLP BibTeX RDF
23	Shengluo Yang, Junyi Wang, Zhigang Xu 0003	Real-time scheduling for distributed permutation flowshops with dynamic job arrivals using deep reinforcement learning.	Adv. Eng. Informatics	2022	DBLP DOI BibTeX RDF
23	Chen-Yang Cheng, Pourya Pourhejazy, Kuo-Ching Ying, Shi-Yao Huang	New Benchmark Algorithm for Minimizing Total Completion Time in blocking flowshops with sequence-dependent setup times.	Appl. Soft Comput.	2021	DBLP DOI BibTeX RDF
23	Vahid Riahi, M. A. Hakim Newton, Abdul Sattar 0001	Constraint based local search for flowshops with sequence-dependent setup times.	Eng. Appl. Artif. Intell.	2021	DBLP DOI BibTeX RDF
23	Jianer Chen, Minjie Huang, Yin Guo	Scheduling on Multiple Two-Stage Flowshops with a Deadline.	AAIM	2021	DBLP DOI BibTeX RDF
23	Chen-Yang Cheng, Shih-Wei Lin, Pourya Pourhejazy, Kuo-Ching Ying, Jia-Wen Zheng	Minimizing Total Completion Time in Mixed-Blocking Permutation Flowshops.	IEEE Access	2020	DBLP DOI BibTeX RDF
23	Pourya Pourhejazy, Shih-Wei Lin, Chen-Yang Cheng, Kuo-Ching Ying, Pei-Yu Lin	Improved Beam Search for Optimizing No-Wait Flowshops With Release Times.	IEEE Access	2020	DBLP DOI BibTeX RDF
23	Guangwei Wu, Jianer Chen, Jianxin Wang 0001	Improved approximation algorithms for two-stage flowshops scheduling problem.	Theor. Comput. Sci.	2020	DBLP DOI BibTeX RDF
23	Guangwei Wu, Jianer Chen, Jianxin Wang 0001	On scheduling multiple two-stage flowshops.	Theor. Comput. Sci.	2020	DBLP DOI BibTeX RDF
23	Hande Öztop, Mehmet Fatih Tasgetiren, Levent Kandiller, Deniz Türsel Eliiyi, Liang Gao 0001	Ensemble of metaheuristics for energy-efficient hybrid flowshops: Makespan versus total energy consumption.	Swarm Evol. Comput.	2020	DBLP DOI BibTeX RDF
23	Damla Yüksel, Mehmet Fatih Tasgetiren, Levent Kandiller, Quan-Ke Pan	Metaheuristics for Energy-Efficient No-Wait Flowshops: A Trade-off Between Makespan and Total Energy Consumption.	CEC	2020	DBLP DOI BibTeX RDF
23	Chen-Yang Cheng, Kuo-Ching Ying, Hsia-Hsiang Chen, Hsiao-Shan Lu	Minimising makespan in distributed mixed no-idle flowshops.	Int. J. Prod. Res.	2019	DBLP DOI BibTeX RDF
23	Mikhail Y. Kovalyov, Gur Mosheiov, Dmitrij Sesok	Comments on "Proportionate flowshops with general position dependent processing times" [Inf. Process. Lett. 111 and "Minimizing total load on a proportionate flowshop with position-dependent processing times and job-rejection" [Inf. Process. Lett. 132 (2018) 39-43].	Inf. Process. Lett.	2019	DBLP DOI BibTeX RDF
23	M. A. Hakim Newton, Vahid Riahi, Kaile Su, Abdul Sattar 0001	Scheduling blocking flowshops with setup times via constraint guided and accelerated local search.	Comput. Oper. Res.	2019	DBLP DOI BibTeX RDF
23	Guangwei Wu, Jianer Chen, Jianxin Wang 0001	Scheduling two-stage jobs on multiple flowshops.	Theor. Comput. Sci.	2019	DBLP DOI BibTeX RDF
23	Guangwei Wu, Jianer Chen, Jianxin Wang 0001	On scheduling inclined jobs on multiple two-stage flowshops.	Theor. Comput. Sci.	2019	DBLP DOI BibTeX RDF
23	Chen-Yang Cheng, Kuo-Ching Ying, Shu-Fen Li, Ya-Chu Hsieh	Minimizing makespan in mixed no-wait flowshops with sequence-dependent setup times.	Comput. Ind. Eng.	2019	DBLP DOI BibTeX RDF
23	Jose M. Framiñan, Rainer Leisten	Linking Scheduling Criteria to Shop Floor Performance in Permutation Flowshops.	Algorithms	2019	DBLP DOI BibTeX RDF
23	Guanghui Zhang, Keyi Xing, Feng Cao	Scheduling distributed flowshops with flexible assembly and set-up time to minimise makespan.	Int. J. Prod. Res.	2018	DBLP DOI BibTeX RDF
23	Guangwei Wu, Jianer Chen, Jianxin Wang 0001	On Scheduling Two-Stage Jobs on Multiple Two-Stage Flowshops.	CoRR	2018	DBLP BibTeX RDF
23	Yi Xu, Xiaoping Li 0001, Chaomin Shi, Mingyu Cui, Xincheng Cao, Yanyan Ge	A Metaheuristic for No-wait Flowshops with Variable Processing Times.	CSCWD	2018	DBLP DOI BibTeX RDF
23	Vahid Riahi, M. A. Hakim Newton, Kaile Su, Abdul Sattar 0001	Local Search for Flowshops with Setup Times and Blocking Constraints.	ICAPS	2018	DBLP BibTeX RDF
23	Guangwei Wu, Jianer Chen	Approximation Algorithms on Multiple Two-Stage Flowshops.	COCOON	2018	DBLP DOI BibTeX RDF
23	Asiye Aydilek, Harun Aydilek, Ali Allahverdi	Minimising maximum tardiness in assembly flowshops with setup times.	Int. J. Prod. Res.	2017	DBLP DOI BibTeX RDF
23	Kuo-Ching Ying, Shih-Wei Lin	Minimizing Makespan in Distributed Blocking Flowshops Using Hybrid Iterated Greedy Algorithms.	IEEE Access	2017	DBLP DOI BibTeX RDF
23	Quan-Ke Pan, Rubén Ruiz, Pedro Alfaro-Fernández	Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows.	Comput. Oper. Res.	2017	DBLP DOI BibTeX RDF
23	Alessandro Agnetis, Gur Mosheiov	Scheduling with job-rejection and position-dependent processing times on proportionate flowshops.	Optim. Lett.	2017	DBLP DOI BibTeX RDF
23	Mehmet Fatih Tasgetiren, Quan-Ke Pan, Damla Kizilay, Mario C. Vélez-Gallego	A variable block insertion heuristic for permutation flowshops with makespan criterion.	CEC	2017	DBLP DOI BibTeX RDF
23	Guangwei Wu, Jianxin Wang 0001	Approximation Algorithms for Scheduling Multiple Two-Stage Flowshops.	COCOON	2017	DBLP DOI BibTeX RDF
23	Florence Thiard	Scheduling handling resources: robotic flowshops with circular layout and a practical railway problem. (Ordonnancement de ressources de transports : flow-shops robotisés circulaires et un problème pratique de gestion ferroviaire).		2017	RDF
23	Korhan Karabulut	A hybrid iterated greedy algorithm for total tardiness minimization in permutation flowshops.	Comput. Ind. Eng.	2016	DBLP DOI BibTeX RDF
23	Kuo-Ching Ying, Shih-Wei Lin, Wen-Jie Wu	Self-adaptive ruin-and-recreate algorithm for minimizing total flow time in no-wait flowshops.	Comput. Ind. Eng.	2016	DBLP DOI BibTeX RDF
23	Umar Waqas, Marc Geilen, Sander Stuijk, Joost van Pinxten, Twan Basten, Lou J. Somers, Henk Corporaal	A Fast Estimator of Performance with Respect to the Design Parameters of Self Re-Entrant Flowshops.	DSD	2016	DBLP DOI BibTeX RDF
23	Victor Fernandez-Viagas, Jose M. Framiñan	A new set of high-performing heuristics to minimise flowtime in permutation flowshops.	Comput. Oper. Res.	2015	DBLP DOI BibTeX RDF
23	Shih-Wei Lin, Kuo-Ching Ying	Order acceptance and scheduling to maximize total net revenue in permutation flowshops with weighted tardiness.	Appl. Soft Comput.	2015	DBLP DOI BibTeX RDF
23	Fatima Benbouzid-Si Tayeb, Abdessalam Messiaid, Karima Benatchba	Game theoretic modelling of the integrated production and preventive maintenance scheduling problem in permutation flowshops.	CDC	2015	DBLP DOI BibTeX RDF
23	Ali Allahverdi, Harun Aydilek	Total completion time with makespan constraint in no-wait flowshops with setup times.	Eur. J. Oper. Res.	2014	DBLP DOI BibTeX RDF
23	Gengcheng Liu, Shiji Song, Cheng Wu	Some heuristics for no-wait flowshops with total tardiness criterion.	Comput. Oper. Res.	2013	DBLP DOI BibTeX RDF
23	Shih-Wei Lin, Kuo-Ching Ying	Minimizing makespan and total flowtime in permutation flowshops by a bi-objective multi-start simulated-annealing algorithm.	Comput. Oper. Res.	2013	DBLP DOI BibTeX RDF
23	Shih-Wei Lin, Kuo-Ching Ying, Chien-Yi Huang	Multiprocessor task scheduling in multistage hybrid flowshops: A hybrid artificial bee colony algorithm with bi-directional planning.	Comput. Oper. Res.	2013	DBLP DOI BibTeX RDF
23	Dongchen Lu, Rasaratnam Logendran	Scheduling jobs in flowshops with the introduction of additional machines in the future.	Expert Syst. Appl.	2012	DBLP DOI BibTeX RDF
23	Pedro Gómez-Gasquet, Carlos Andrés, Francisco-Cruz Lario Esteban	An agent-based genetic algorithm for hybrid flowshops with sequence dependent setup times to minimise makespan.	Expert Syst. Appl.	2012	DBLP DOI BibTeX RDF
23	Wen-Hung Kuo, Dar-Li Yang	A short note on "Proportionate flowshops with general position-dependent processing times".	Inf. Process. Lett.	2012	DBLP DOI BibTeX RDF
23	Harun Aydilek, Ali Allahverdi	Heuristics for no-wait flowshops with makespan subject to mean completion time.	Appl. Math. Comput.	2012	DBLP DOI BibTeX RDF
23	Yi Zhang 0009, Xiaoping Li 0001	A Quantum-inspired Iterated Greedy algorithm for permutation flowshops in a collaborative manufacturing environment.	Int. J. Comput. Integr. Manuf.	2012	DBLP DOI BibTeX RDF
23	Mehmet Fatih Tasgetiren, Quan-Ke Pan, Ponnuthurai N. Suganthan, Ozge Buyukdagli	A Variable Iterated Greedy Algorithm with Differential Evolution for Solving No-Idle Flowshops.	ICAISC (SIDE-EC)	2012	DBLP DOI BibTeX RDF
23	Ehram Safari, Seyed Jafar Sadjadi	A hybrid method for flowshops scheduling with condition-based maintenance constraint and machines breakdown.	Expert Syst. Appl.	2011	DBLP DOI BibTeX RDF
23	Gur Mosheiov	Proportionate flowshops with general position-dependent processing times.	Inf. Process. Lett.	2011	DBLP DOI BibTeX RDF
23	Hoong Chuin Lau, Zhengyi John Zhao, Shuzhi Sam Ge, Tong Heng Lee	Allocating Resources in Multiagent Flowshops With Adaptive Auctions.	IEEE Trans Autom. Sci. Eng.	2011	DBLP DOI BibTeX RDF
23	Djamal Rebaine	Scheduling flexible flowshops with unit-time operations and minimum time delays.	Electron. Notes Discret. Math.	2010	DBLP DOI BibTeX RDF
23	Talip Kellegöz, Bilal Toklu, John M. Wilson 0001	Elite guided steady-state genetic algorithm for minimizing total tardiness in flowshops.	Comput. Ind. Eng.	2010	DBLP DOI BibTeX RDF
23	Yves Crama, Hakan Gultekin	Throughput optimization in two-machine flowshops with flexible operations.	J. Sched.	2010	DBLP DOI BibTeX RDF
23	Susumu Fujii, Koji Urayama, Kenji Kashima, Jun-ichi Imura, Tetsuaki Kurokawa, Shuichi Adachi	Machine-based Modeling of Conveyor-type Flowshops with Application to Scheduling and Temperature Control in Slab Reheating Furnace.	CCA	2010	DBLP DOI BibTeX RDF
23	Suchithra Rajendran, Chandrasekharan Rajendran, Hans Ziegler	An Ant-Colony Algorithm to Transform Jobshops into Flowshops: A Case of Shortest-Common-Supersequence Stringology Problem.	BIONETICS	2010	DBLP DOI BibTeX RDF
23	Yi Zhang 0009, Xiaoping Li 0001	A Quantum-inspired Iterated Greedy algorithm for permutation flowshops with total flowtime minimization.	SMC	2010	DBLP DOI BibTeX RDF
23	Masoud Jenabi, Bahman Naderi, S. M. T. Fatemi Ghomi	A bi-objective case of no-wait flowshops.	BIC-TA	2010	DBLP DOI BibTeX RDF
23	B. Naderi 0001, Mostafa Zandieh, A. Khaleghi Ghoshe Balagh, Vahid Roshanaei	An improved simulated annealing for hybrid flowshops with sequence-dependent setup and transportation times to minimize total completion time and total tardiness.	Expert Syst. Appl.	2009	DBLP DOI BibTeX RDF
23	Paz Perez-Gonzalez, Jose M. Framiñan	Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics.	Comput. Oper. Res.	2009	DBLP DOI BibTeX RDF
23	N. Madhushini, Chandrasekharan Rajendran, Y. Deepa	Branch-and-bound algorithms for scheduling in permutation flowshops to minimize the sum of weighted flowtime/sum of weighted tardiness/sum of weighted flowtime and weighted tardiness/sum of weighted flowtime, weighted tardiness and weighted earliness of jobs.	J. Oper. Res. Soc.	2009	DBLP DOI BibTeX RDF
23	R. Rajkumar, P. Shahabudeen	Bi-criteria improved genetic algorithm for scheduling in flowshops to minimise makespan and total flowtime of jobs.	Int. J. Comput. Integr. Manuf.	2009	DBLP DOI BibTeX RDF
23	B. Naderi 0001, Mostafa Zandieh, M. A. H. A. Shirazi	Modeling and scheduling a case of flexible flowshops: Total weighted tardiness minimization.	Comput. Ind. Eng.	2009	DBLP DOI BibTeX RDF
23	F. Jabbarizadeh, Mostafa Zandieh, Davoud Talebi	Hybrid flexible flowshops with sequence-dependent setup times and machine availability constraints.	Comput. Ind. Eng.	2009	DBLP DOI BibTeX RDF
23	Geun-Cheol Lee	Estimating order lead times in hybrid flowshops with different scheduling rules.	Comput. Ind. Eng.	2009	DBLP DOI BibTeX RDF
23	Rubén Ruiz, Ali Allahverdi	Some effective heuristics for no-wait flowshops with setup times to minimize total completion time.	Ann. Oper. Res.	2007	DBLP DOI BibTeX RDF	No-wait, Total flowtime, Setup times, Stochastic local search, Flowshop
23	Rajesh Swaminathan, Michele E. Pfund, John W. Fowler, Scott J. Mason, Ahmet B. Keha	Impact of permutation enforcement when minimizing total weighted tardiness in dynamic flowshops with uncertain processing times.	Comput. Oper. Res.	2007	DBLP DOI BibTeX RDF
23	Chandrasekharan Rajendran, Knut Alicke	Dispatching in flowshops with bottleneck machines.	Comput. Ind. Eng.	2007	DBLP DOI BibTeX RDF
23	S. Chandrasekaran, S. G. Ponnambalam, R. K. Suresh, N. Vijayakumar	Multi-objective particle swarm optimization algorithm for scheduling in flowshops to minimize makespan, total flowtime and completion time variance.	IEEE Congress on Evolutionary Computation	2007	DBLP DOI BibTeX RDF
23	Rubén Ruiz, Concepción Maroto	A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility.	Eur. J. Oper. Res.	2006	DBLP DOI BibTeX RDF
23	Gerrit Färber, Anna M. Coves Moreno	Performance Study of a Genetic Algorithm for Sequencing in Mixed Model Non-permutation Flowshops Using Constrained Buffers.	ICCSA (3)	2006	DBLP DOI BibTeX RDF
23	Jose M. Framiñan, Rainer Leisten, Rafael Ruiz-Usano	Comparison of heuristics for flowtime minimisation in permutation flowshops.	Comput. Oper. Res.	2005	DBLP DOI BibTeX RDF
23	T. K. Varadharajan, Chandrasekharan Rajendran	A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs.	Eur. J. Oper. Res.	2005	DBLP DOI BibTeX RDF
23	Chandrasekharan Rajendran, Hans Ziegler	Two ant-colony algorithms for minimizing total flowtime in permutation flowshops.	Comput. Ind. Eng.	2005	DBLP DOI BibTeX RDF
23	George L. Vairaktarakis	Flexible Hybrid Flowshops.	Handbook of Scheduling	2004	DBLP BibTeX RDF
23	Teofilo F. Gonzalez	Flexible Hybrid Flowshops.	Handbook of Scheduling	2004	DBLP BibTeX RDF
23	Ali Allahverdi, Tariq A. Aldowaisan	No-wait flowshops with bicriteria of makespan and maximum lateness.	Eur. J. Oper. Res.	2004	DBLP DOI BibTeX RDF
23	Tariq A. Aldowaisan, Ali Allahverdi	New heuristics for no-wait flowshops to minimize makespan.	Comput. Oper. Res.	2003	DBLP DOI BibTeX RDF
23	Nicholas G. Hall, Gilbert Laporte, Esaignani Selvarajah, Chelliah Sriskandarajah	Scheduling and Lot Streaming in Flowshops with No-Wait in Process.	J. Sched.	2003	DBLP DOI BibTeX RDF
23	Ali Allahverdi, Tariq A. Aldowaisan	No-wait flowshops with bicriteria of makespan and total completion time.	J. Oper. Res. Soc.	2002	DBLP DOI BibTeX RDF
23	Carlos Andrés	Scheduling in Hybrid Flowshops with Sequence Dependent Setup Times. A MILP Model and a Simulated Annealing Based Approach.	IC-AI	2002	DBLP BibTeX RDF
23	Tariq A. Aldowaisan	A new heuristic and dominance relations for no-wait flowshops with setups.	Comput. Oper. Res.	2001	DBLP DOI BibTeX RDF
23	Débora P. Ronconi, Vinícius Amaral Armentano	Lower bounding schemes for flowshops with blocking in-process.	J. Oper. Res. Soc.	2001	DBLP DOI BibTeX RDF
23	Robert L. Burdett, Erhan Kozan	Sequencing and scheduling in flowshops with task redistribution.	J. Oper. Res. Soc.	2001	DBLP DOI BibTeX RDF
23	Christos Koulamas, George J. Kyparisis	A note on scheduling flowshops with flexible stage ordering.	Eur. J. Oper. Res.	2001	DBLP DOI BibTeX RDF
23	Chandrasekharan Rajendran, Hans Ziegler	A performance analysis of dispatching rules and a heuristic in static flowshops with missing operations of jobs.	Eur. J. Oper. Res.	2001	DBLP DOI BibTeX RDF
23	Yves Crama, Vladimir Kats, Joris van de Klundert, Eugene Levner	Cyclic scheduling in robotic flowshops.	Ann. Oper. Res.	2000	DBLP DOI BibTeX RDF
23	Ngo-Tai Fong, Xun Yu Zhou	Optimal feedback controls in deterministic two-machine flowshops with finite buffers.	IEEE Trans. Autom. Control.	2000	DBLP DOI BibTeX RDF
23	Chandrasekharan Rajendran, Oliver Holthaus	A comparative study of dispatching rules in dynamic flowshops and jobshops.	Eur. J. Oper. Res.	1999	DBLP DOI BibTeX RDF
23	Ali Allahverdi	Stochastically minimizing total flowtime in flowshops with no waiting space.	Eur. J. Oper. Res.	1999	DBLP DOI BibTeX RDF
23	Tariq A. Aldowaisan, Ali Allahverdi	Total flowtime in no-wait flowshops with separated setup times.	Comput. Oper. Res.	1998	DBLP DOI BibTeX RDF