Search results for "Open Shop"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
3	Haidar M. Harmanani, Fouad Drouby, Steve Bou Ghosn	A parallel genetic algorithm for the open-shop scheduling problem using deterministic and random moves.	SpringSim	2009	DBLP DOI BibTeX RDF	open-shop scheduling, parallel genetic algorithms
3	Dominique de Werra, Tamás Kis, Wieslaw Kubiak	Preemptive open shop scheduling with multiprocessors: polynomial cases and applications.	J. Scheduling	2008	DBLP DOI BibTeX RDF	Preemptive open shop scheduling, Multiprocessor operations, Polynomial time algorithms
3	Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai	Improved results for data migration and open shop scheduling.	ACM Transactions on Algorithms	2006	DBLP DOI BibTeX RDF	open shop, scheduling, Approximation algorithms, linear programming, data migration, LP rounding
3	Natalia V. Shakhlevich	Open shop unit-time scheduling problems with symmetric objective functions.	4OR	2005	DBLP DOI BibTeX RDF	Open shop scheduling, symmetric function, parallel machine scheduling
2	Juan José Palacios, Jorge Puente, Camino R. Vela, Inés González Rodríguez	A Genetic Algorithm for the Open Shop Problem with Uncertain Durations.	IWINAC	2009	DBLP DOI BibTeX RDF
2	Diarmuid Grimes, Emmanuel Hebrard, Arnaud Malapert	Closing the Open Shop: Contradicting Conventional Wisdom.	CP	2009	DBLP DOI BibTeX RDF
2	Naoyuki Tamura, Akiko Taga, Satoshi Kitagawa, Mutsunori Banbara	Compiling finite linear CSP into SAT.	Constraints	2009	DBLP DOI BibTeX RDF	SAT encoding, Open-shop scheduling problems, Constraint satisfaction problems
2	G. I. Zobolas, Christos D. Tarantilis, George Ioannou	Exact, Heuristic and Meta-heuristic Algorithms for Solving Shop Scheduling Problems.	Metaheuristics for Scheduling in Industrial and Manufacturing Applications	2008	DBLP DOI BibTeX RDF	Single and Parallel Machines Scheduling, Shop Scheduling, Open Shop, Group Shop, Mixed Shop, Meta-heuristics, Job Shop, Flow Shop, Production Scheduling
2	Jean-Noël Monette, Yves Deville, Pierre Dupont	A Position-Based Propagator for the Open-Shop Problem.	CPAIOR	2007	DBLP DOI BibTeX RDF
2	Thomas A. Roemer	A note on the complexity of the concurrent open shop problem.	J. Scheduling	2006	DBLP DOI BibTeX RDF	Order scheduling, Internal and external performance measures, Complexity, Total completion time
2	Qingyun Yang, Jigui Sun, Juyang Zhang, Chunjie Wang	A Hybrid Discrete Particle Swarm Algorithm for Open-Shop Problems.	SEAL	2006	DBLP DOI BibTeX RDF
2	Peter Brucker, Sigrid Knust, T. C. Edwin Cheng, Natalia V. Shakhlevich	Complexity Results for Flow-Shop and Open-Shop Scheduling Problems with Transportation Delays.	Annals OR	2004	DBLP DOI BibTeX RDF	transportation delays, shop problems, scheduling, time-lags, complexity results
2	Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai	Improved Results for Data Migration and Open Shop Scheduling.	ICALP	2004	DBLP DOI BibTeX RDF
2	Jorge Puente, Helio R. Díez, Ramiro Varela, Camino R. Vela, Luis P. Hidalgo	Heuristic Rules and Genetic Algorithms for Open Shop Scheduling Problem.	CAEPIA	2003	DBLP DOI BibTeX RDF
2	Roman A. Koryakin	On the Stochastic Open Shop Problem.	SAGA	2003	DBLP DOI BibTeX RDF
2	Maurice Queyranne, Maxim Sviridenko	A (2+epsilon)-Approximation Algorithm for Generalized Preemptive Open Shop Problem with Minsum Objective.	IPCO	2001	DBLP DOI BibTeX RDF
2	Prashanth B. Bhat, Viktor K. Prasanna, Cauligi S. Raghavendra	Adaptive Communication Algorithms for Distributed Heterogeneous Systems. (PDF / PS)	HPDC	1998	DBLP DOI BibTeX RDF	Network-based computing, adaptive communication scheduling, open shop scheduling, bipartite weighted graph matching, all-to-all personalized communication
2	Teofilo F. Gonzalez, Sartaj Sahni	Open Shop Scheduling to Minimize Finish Time.	J. ACM	1976	DBLP DOI BibTeX RDF
1	Samane Noori-Darvish, Iraj Mahdavi, Nezam Mahdavi-Amiri	A bi-objective possibilistic programming model for open shop scheduling problems with sequence-dependent setup times, fuzzy processing times, and fuzzy due dates.	Appl. Soft Comput.	2012	DBLP DOI BibTeX RDF
1	Rongjun Chen, Wanzhen Huang, Zhongxian Men, Guochun Tang	Open-shop dense schedules: properties and worst-case performance ratio.	J. Scheduling	2012	DBLP DOI BibTeX RDF
1	Baruch Mor, Gur Mosheiov, Daniel Oron	The equal allocation policy in open shop batch scheduling.	JORS	2012	DBLP DOI BibTeX RDF
1	Hadi Panahi, Reza Tavakkoli-Moghaddam	Solving a multi-objective open shop scheduling problem by a novel hybrid ant colony optimization.	Expert Syst. Appl.	2011	DBLP DOI BibTeX RDF
1	Yueh-Min Huang, Jin-Chen Lin	A new bee colony optimization algorithm with idle-time-based filtering scheme for open shop-scheduling problems.	Expert Syst. Appl.	2011	DBLP DOI BibTeX RDF
1	Wei Yu, Zhaohui Liu, Leiyang Wang, Tijun Fan	Routing open shop and flow shop scheduling problems.	European Journal of Operational Research	2011	DBLP DOI BibTeX RDF
1	Shisheng Li	Scheduling Proportionally deteriorating Jobs in Two-Machine Open shop with a Non-Bottleneck Machine.	APJOR	2011	DBLP DOI BibTeX RDF
1	Evgeny V. Shchepin, Nodari Vakhania	A note on the proof of the complexity of the little-preemptive open-shop problem.	Annals OR	2011	DBLP DOI BibTeX RDF
1	Christian Eggermont, Alexander Schrijver, Gerhard J. Woeginger	Analysis of multi-stage open shop processing systems	CoRR	2011	DBLP BibTeX RDF
1	Danyu Bai, Lixin Tang	Performance analysis of rotation schedule and improved strategy for open shop problem to minimise makespan.	Int. J. Systems Science	2011	DBLP DOI BibTeX RDF
1	Christian Eggermont, Alexander Schrijver, Gerhard J. Woeginger	Analysis of multi-stage open shop processing systems.	STACS	2011	DBLP DOI BibTeX RDF
1	Juan José Palacios, Inés González Rodríguez, Camino R. Vela, Jorge Puente	Particle Swarm Optimisation for Open Shop Problems with Fuzzy Durations.	IWINAC	2011	DBLP DOI BibTeX RDF
1	Monaldo Mastrolilli, Maurice Queyranne, Andreas S. Schulz, Ola Svensson, Nelson A. Uhan	Minimizing the sum of weighted completion times in a concurrent open shop.	Oper. Res. Lett.	2010	DBLP DOI BibTeX RDF
1	Tamás Kis, Dominique de Werra, Wieslaw Kubiak	A projective algorithm for preemptive open shop scheduling with two multiprocessor groups.	Oper. Res. Lett.	2010	DBLP DOI BibTeX RDF
1	Ming Liu, Chengbin Chu, Yinfeng Xu, Feifeng Zheng	An optimal online algorithm for two-machine open shop preemptive scheduling with bounded processing times.	Optimization Letters	2010	DBLP DOI BibTeX RDF
1	Alix Munier Kordon, Djamal Rebaine	The two-machine open-shop problem with unit-time operations and time delays to minimize the makespan.	European Journal of Operational Research	2010	DBLP DOI BibTeX RDF
1	Xiandong Zhang, Steef L. van de Velde	On-line two-machine open shop scheduling with time lags.	European Journal of Operational Research	2010	DBLP DOI BibTeX RDF
1	Marie E. Matta, Salah E. Elmaghraby	Polynomial time algorithms for two special classes of the proportionate multiprocessor open shop.	European Journal of Operational Research	2010	DBLP DOI BibTeX RDF
1	B. Naderi, S. M. T. Fatemi Ghomi, M. Aminnayeri, M. Zandieh	A contribution and new heuristics for open shop scheduling.	Computers & OR	2010	DBLP DOI BibTeX RDF
1	Inés González Rodríguez, Juan José Palacios, Camino R. Vela, Jorge Puente	Heuristic local search for fuzzy open shop scheduling.	FUZZ-IEEE	2010	DBLP DOI BibTeX RDF
1	Bahman Naderi, Masoud Jenabi, S. M. T. Fatemi Ghomi, Davoud Talebi	An electromagnetism-like metaheuristic for sequence dependent open shop scheduling.	BIC-TA	2010	DBLP DOI BibTeX RDF
1	G. I. Zobolas, Christos D. Tarantilis, George Ioannou	Solving the Open Shop Scheduling Problem via a Hybrid Genetic-Variable Neighborhood Search Algorithm.	Cybernetics and Systems	2009	DBLP DOI BibTeX RDF
1	Antonio Sedeño-Noda, David Alcaide López de Pablo, Carlos González-Martín	A network flow-based method to solve performance cost and makespan open-shop scheduling problems with time-windows.	European Journal of Operational Research	2009	DBLP DOI BibTeX RDF
1	Marie E. Matta	A genetic algorithm for the proportionate multiprocessor open shop.	Computers & OR	2009	DBLP DOI BibTeX RDF
1	Ilya Chernykh, Nikita Dryuck, Alexander Kononov, Sergey Sevastyanov	The Routing Open Shop Problem: New Approximation Algorithms.	WAOA	2009	DBLP DOI BibTeX RDF
1	Rongjun Chen, Baoqiang Fan, Guochun Tang	Scheduling Problems in Cross Docking.	COCOA	2009	DBLP DOI BibTeX RDF	Cross docking, Scheduling, Heuristics
1	Alexander Kononov, Sergey Sevastyanov, Maxim Sviridenko	Complete Complexity Classification of Short Shop Scheduling.	CSR	2009	DBLP DOI BibTeX RDF
1	Rajiv Gandhi, Julián Mestre	Combinatorial Algorithms for Data Migration to Minimize Average Completion Time.	Algorithmica	2009	DBLP DOI BibTeX RDF	Min-sum scheduling problems, Approximation algorithms, Primal-dual algorithms
1	Michael Andresen, Heidemarie Bräsel, Marc Mörig, Jan Tusch, Frank Werner, Per Willenius	Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop.	Mathematical and Computer Modelling	2008	DBLP DOI BibTeX RDF
1	Rongjun Chen, Wanzhen Huang, Guochun Tang	Dense open-shop schedules with release times.	Theor. Comput. Sci.	2008	DBLP DOI BibTeX RDF
1	Gur Mosheiov, Daniel Oron	Open-shop batch scheduling with identical jobs.	European Journal of Operational Research	2008	DBLP DOI BibTeX RDF
1	Heidemarie Bräsel, André Herms, Marc Mörig, Thomas Tautenhahn, Jan Tusch, Frank Werner	Heuristic constructive algorithms for open shop scheduling to minimize mean flow time.	European Journal of Operational Research	2008	DBLP DOI BibTeX RDF
1	D. Y. Sha, Cheng-Yu Hsu	A new particle swarm optimization for the open shop scheduling problem.	Computers & OR	2008	DBLP DOI BibTeX RDF
1	Hadi Panahi, Masoud Rabbani, Reza Tavakkoli-Moghaddam	Solving an Open Shop Scheduling Problem by a Novel Hybrid Multi-Objective Ant Colony Optimization.	HIS	2008	DBLP DOI BibTeX RDF
1	Magnús M. Halldórsson, Guy Kortsarz, Maxim Sviridenko	Min Sum Edge Coloring in Multigraphs Via Configuration LP.	IPCO	2008	DBLP DOI BibTeX RDF	Edge Scheduling, Configuration LP, Approximation Algorithms
1	Evgeny V. Shchepin, Nodari Vakhania	On the geometry, preemptions and complexity of multiprocessor and shop scheduling.	Annals OR	2008	DBLP DOI BibTeX RDF	Shop scheduling, Algorithm, Time complexity, Multiprocessor scheduling, Preemption
1	T. C. Edwin Cheng, Natalia V. Shakhlevich	Two-machine open shop problem with controllable processing times.	Discrete Optimization	2007	DBLP DOI BibTeX RDF
1	Philippe Baptiste, Peter Brucker, Marek Chrobak, Christoph Dürr, Svetlana A. Kravchenko, Francis Sourd	The complexity of mean flow time scheduling problems with release times.	J. Scheduling	2007	DBLP DOI BibTeX RDF	Linear programming, Preemption, Scheduling theory
1	Irina V. Gribkovskaia, Chung-Yee Lee, Vitaly A. Strusevich, Dominique de Werra	Three is easy, two is hard: open shop sum-batch scheduling problem refined.	Oper. Res. Lett.	2006	DBLP DOI BibTeX RDF
1	Antonio Sedeño-Noda, David Alcaide López de Pablo, Carlos González-Martín	Network flow approaches to pre-emptive open-shop scheduling problems with time-windows.	European Journal of Operational Research	2006	DBLP DOI BibTeX RDF
1	Igor Averbakh, Oded Berman, Ilya Chernykh	The routing open-shop problem on a network: Complexity and approximation.	European Journal of Operational Research	2006	DBLP DOI BibTeX RDF
1	Sugam Pandey, Niranjan, Aura Ganz	Proportional Service Differentiation for Multichannel Wireless Networks.	BROADNETS	2006	DBLP DOI BibTeX RDF
1	Rajiv Gandhi, Julián Mestre	Combinatorial Algorithms for Data Migration to Minimize Average Completion Time.	APPROX-RANDOM	2006	DBLP DOI BibTeX RDF
1	Naoyuki Tamura, Akiko Taga, Satoshi Kitagawa, Mutsunori Banbara	Compiling Finite Linear CSP into SAT.	CP	2006	DBLP DOI BibTeX RDF
1	T. C. Edwin Cheng, Natalia V. Shakhlevich	Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem.	European Journal of Operational Research	2005	DBLP DOI BibTeX RDF
1	Marek Kubale, Adam Nadolski	Chromatic scheduling in a cyclic open shop.	European Journal of Operational Research	2005	DBLP DOI BibTeX RDF
1	Igor Averbakh, Oded Berman, Ilya Chernykh	A 6/5-approximation algorithm for the two-machine routing open-shop problem on a two-node network.	European Journal of Operational Research	2005	DBLP DOI BibTeX RDF
1	Christian Blum	Beam-ACO - hybridizing ant colony optimization with beam search: an application to open shop scheduling.	Computers & OR	2005	DBLP DOI BibTeX RDF
1	James Montgomery, Marcus Randall, Tim Hendtlass	Structural Advantages for Ant Colony Optimisation Inherent in Permutation Scheduling Problems.	IEA/AIE	2005	DBLP DOI BibTeX RDF	heuristic search, planning and scheduling
1	Gur Mosheiov, Uri Yovel	Comments on "Flow shop and open shop scheduling with a critical machine and two operations per job".	European Journal of Operational Research	2004	DBLP DOI BibTeX RDF
1	Heidemarie Bräsel, Holger Hennes	On the open-shop problem with preemption and minimizing the average completion time.	European Journal of Operational Research	2004	DBLP DOI BibTeX RDF
1	Jacek Blazewicz, Erwin Pesch, Malgorzata Sterna, Frank Werner	Open shop scheduling problems with late work criteria.	Discrete Applied Mathematics	2004	DBLP DOI BibTeX RDF
1	Konstantinos Chatzikokolakis, George Boukeas, Panagiotis Stamatopoulos	Construction and Repair: A Hybrid Approach to Search in CSPs.	SETN	2004	DBLP DOI BibTeX RDF	search, heuristics, constraint satisfaction
1	Philippe Baptiste, Peter Brucker, Sigrid Knust, Vadim G. Timkovsky	Ten notes on equal-processing-time scheduling.	4OR	2004	DBLP DOI BibTeX RDF	Scheduling, computational complexity, polynomial time
1	Marjan van den Akker, Han Hoogeveen, Gerhard J. Woeginger	The two-machine open shop problem: To fit or not to fit, that is the question.	Oper. Res. Lett.	2003	DBLP DOI BibTeX RDF
1	C. T. Ng, T. C. Edwin Cheng, J. J. Yuan	Concurrent Open Shop Scheduling to Minimize the Weighted Number of Tardy Jobs.	J. Scheduling	2003	DBLP DOI BibTeX RDF
1	Ching-Fang Liaw	An efficient tabu search approach for the two-machine preemptive open shop scheduling problem.	Computers & OR	2003	DBLP DOI BibTeX RDF
1	Brian Towles, William J. Dally	Guaranteed scheduling for switches with configuration overhead.	IEEE/ACM Trans. Netw.	2003	DBLP DOI BibTeX RDF	packet switching, optical switches
1	Alexander Kononov, Maxim Sviridenko	A linear time approximation scheme for makespan minimization in an open shop with release dates.	Oper. Res. Lett.	2002	DBLP DOI BibTeX RDF
1	Krzysztof Giaro, Marek Kubale, Konrad Piwakowski	Complexity results on open shop scheduling to minimize total cost of operations.	Int. J. Comput. Syst. Signal	2002	DBLP BibTeX RDF
1	Maurice Queyranne, Maxim Sviridenko	A (2+epsilon)-approximation algorithm for the generalized preemptive open shop problem with minsum objective.	J. Algorithms	2002	DBLP DOI BibTeX RDF
1	Ching-Fang Liaw, Chun-Yuan Cheng, Mingchih Chen	The total completion time open shop scheduling problem with a given sequence of jobs on one machine.	Computers & OR	2002	DBLP DOI BibTeX RDF
1	Christian Blum	ACO Applied to Group Shop Scheduling: A Case Study on Intensification and Diversification.	Ant Algorithms	2002	DBLP DOI BibTeX RDF
1	Michael Sampels, Christian Blum, Monaldo Mastrolilli, Olivia Rossi-Doria	Metaheuristics for Group Shop Scheduling.	PPSN	2002	DBLP DOI BibTeX RDF
1	J. Christopher Beck, Patrick Prosser, Evgeny Selensky	On the Reformulation of Vehicle Routing Problems and Scheduling Problems.	SARA	2002	DBLP DOI BibTeX RDF
1	Joachim Breit, Günter Schmidt, Vitaly A. Strusevich	Two-machine open shop scheduling with an availability constraint.	Oper. Res. Lett.	2001	DBLP DOI BibTeX RDF
1	Inna G. Drobouchevitch, Vitaly A. Strusevich	Two-stage open shop scheduling with a bottleneck machine.	European Journal of Operational Research	2001	DBLP DOI BibTeX RDF
1	Sergey V. Sevastianov, Gerhard J. Woeginger	Linear time approximation scheme for the multiprocessor open shop problem.	Discrete Applied Mathematics	2001	DBLP DOI BibTeX RDF
1	Tapan P. Bagchi	Parto-Optimal Solutions for Multi-objective Production Scheduling Problems.	EMO	2001	DBLP DOI BibTeX RDF
1	Vitaly A. Strusevich	Group technology approach to the open shop scheduling problem with batch setup times.	Oper. Res. Lett.	2000	DBLP DOI BibTeX RDF
1	Christelle Guéret, Narendra Jussien, Christian Prins	Using intelligent backtracking to improve branch-and-bound methods: An application to Open-Shop problems.	European Journal of Operational Research	2000	DBLP DOI BibTeX RDF
1	Ching-Fang Liaw	A hybrid genetic algorithm for the open shop scheduling problem.	European Journal of Operational Research	2000	DBLP DOI BibTeX RDF
1	George J. Kyparisis, Christos Koulamas	Flow shop and open shop scheduling with a critical machine and two operations per job.	European Journal of Operational Research	2000	DBLP DOI BibTeX RDF
1	George J. Kyparisis, Christos Koulamas	Open shop scheduling with makespan and total completion time criteria.	Computers & OR	2000	DBLP DOI BibTeX RDF
1	Svetlana A. Kravchenko	On the complexity of minimizing the number of late jobs in unit time open shop.	Discrete Applied Mathematics	2000	DBLP DOI BibTeX RDF
1	Krishnendu Chakrabarty	Test scheduling for core-based systems using mixed-integer linearprogramming.	IEEE Trans. on CAD of Integrated Circuits and Systems	2000	DBLP DOI BibTeX RDF
1	Klaus Jansen, Maxim Sviridenko	Polynomial Time Approximation Schemes for the Multiprocessor Open and Flow Shop Scheduling Problem.	STACS	2000	DBLP DOI BibTeX RDF
1	Petra Schuurman, Gerhard J. Woeginger	Approximation algorithms for the multiprocessor open shop scheduling problem.	Oper. Res. Lett.	1999	DBLP DOI BibTeX RDF
1	Vitaly A. Strusevich, A. J. A. van de Waart, R. Dekker	A 3/2 Algorithm for Two-Machine Open Shop with Route-Dependent Processing Times.	J. Heuristics	1999	DBLP DOI BibTeX RDF
1	Ching-Fang Liaw	A tabu search algorithm for the open shop scheduling problem.	Computers & OR	1999	DBLP DOI BibTeX RDF
1	Vitaly A. Strusevich	A Heuristic for the Two-machine Open-shop Scheduling Problem with Transportation Times.	Discrete Applied Mathematics	1999	DBLP DOI BibTeX RDF
1	Sami Khuri, Sowmya Rao Miryala	Genetic Algorithms for Solving Open Shop Scheduling Problems.	EPIA	1999	DBLP DOI BibTeX RDF