Ordonnancements à contraintes disjonctives
RAIRO-Oper. Res., 12 4 (1978) 333-350
Published online: 2017-02-06
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Differential Evolution: A Handbook for Global Permutation-Based Combinatorial Optimization
Donald Davendra and Godfrey OnwuboluStudies in Computational Intelligence, Differential Evolution: A Handbook for Global Permutation-Based Combinatorial Optimization 175 35 (2009)
https://doi.org/10.1007/978-3-540-92151-6_3
An effective hybrid DE-based algorithm for flow shop scheduling with limited buffers
B. Qian, L. Wang, D. X. Huang and X. WangInternational Journal of Production Research 47 (1) 1 (2009)
https://doi.org/10.1080/00207540701528750
An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers
Bin Qian, Ling Wang, De-xian Huang, Wan-liang Wang and Xiong WangComputers & Operations Research 36 (1) 209 (2009)
https://doi.org/10.1016/j.cor.2007.08.007
A novel hybrid quantum-inspired evolutionary algorithm for permutation flow-shop scheduling
Tianmin Zheng and Mitsuo YamashiroJournal of Statistics and Management Systems 12 (6) 1165 (2009)
https://doi.org/10.1080/09720510.2009.10701449
An improved genetic algorithm for the flowshop scheduling problem
R. Rajkumar and P. ShahabudeenInternational Journal of Production Research 47 (1) 233 (2009)
https://doi.org/10.1080/00207540701523041
A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems
Quan-Ke Pan, Ling Wang and Bin QianComputers & Operations Research 36 (8) 2498 (2009)
https://doi.org/10.1016/j.cor.2008.10.008
A constructive heuristic for minimizing makespan in no-wait flow shop scheduling
Dipak Laha and Uday K. ChakrabortyThe International Journal of Advanced Manufacturing Technology 41 (1-2) 97 (2009)
https://doi.org/10.1007/s00170-008-1454-0
A DE-based approach to no-wait flow-shop scheduling
B. Qian, L. Wang, R. Hu, D.X. Huang and X. WangComputers & Industrial Engineering 57 (3) 787 (2009)
https://doi.org/10.1016/j.cie.2009.02.006
Hybrid artificial immune system and extremal optimization algorithm for permutation flowshop scheduling problem
Kai Sun and Gen-ke YangJournal of Shanghai University (English Edition) 12 (4) 352 (2008)
https://doi.org/10.1007/s11741-008-0413-2
2955 (2008)
https://doi.org/10.1109/CEC.2008.4631196
An improved iterated greedy algorithm for the no-wait flow shop scheduling problem with makespan criterion
Quan-Ke Pan, Ling Wang and Bao-Hua ZhaoThe International Journal of Advanced Manufacturing Technology 38 (7-8) 778 (2008)
https://doi.org/10.1007/s00170-007-1120-y
An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers
Bo Liu, Ling Wang and Yi-Hui JinComputers & Operations Research 35 (9) 2791 (2008)
https://doi.org/10.1016/j.cor.2006.12.013
A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem
Quan-Ke Pan, M. Fatih Tasgetiren and Yun-Chia LiangComputers & Operations Research 35 (9) 2807 (2008)
https://doi.org/10.1016/j.cor.2006.12.030
585 (2008)
https://doi.org/10.1145/1389095.1389208
A novel multi-objective particle swarm optimization algorithm for no-wait flow shop scheduling problems
Q-K Pan, L Wang and Qian BProceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture 222 (4) 519 (2008)
https://doi.org/10.1243/09544054JEM989
A hybrid discrete particle swarm optimization algorithm for the no-wait flow shop scheduling problem with makespan criterion
Quan-Ke Pan, Ling Wang, M. Fatih Tasgetiren and Bao-Hua ZhaoThe International Journal of Advanced Manufacturing Technology 38 (3-4) 337 (2008)
https://doi.org/10.1007/s00170-007-1099-4
MICAI 2007: Advances in Artificial Intelligence
Geraldo Ribeiro Filho, Marcelo Seido Nagano and Luiz Antonio Nogueira LorenaLecture Notes in Computer Science, MICAI 2007: Advances in Artificial Intelligence 4827 1099 (2007)
https://doi.org/10.1007/978-3-540-76631-5_105
Simple heuristics for scheduling with limited intermediate storage
Andreas Witt and Stefan VoßComputers & Operations Research 34 (8) 2293 (2007)
https://doi.org/10.1016/j.cor.2005.09.004
An effective hybrid particle swarm optimization for no-wait flow shop scheduling
Bo Liu, Ling Wang and Yi-Hui JinThe International Journal of Advanced Manufacturing Technology 31 (9-10) 1001 (2007)
https://doi.org/10.1007/s00170-005-0277-5
A NEW HEURISTIC-EM FOR PERMUTATION FLOWSHOP SCHEDULING
Kun Yuan, Sophie Hennequin, Xiaojuan Wang and Liang GaoIFAC Proceedings Volumes 39 (3) 33 (2006)
https://doi.org/10.3182/20060517-3-FR-2903.00023
Implementation of grasp in flow shop scheduling
G. Prabhaharan, B. Shahul Hamid Khan and L. RakeshThe International Journal of Advanced Manufacturing Technology 30 (11-12) 1126 (2006)
https://doi.org/10.1007/s00170-005-0134-6
A local search method for permutation flow shop scheduling
W Q Huang and L WangJournal of the Operational Research Society 57 (10) 1248 (2006)
https://doi.org/10.1057/palgrave.jors.2602106
Advances in Applied Artificial Intelligence
Lin-Yu Tseng and Ya-Tai LinLecture Notes in Computer Science, Advances in Applied Artificial Intelligence 4031 218 (2006)
https://doi.org/10.1007/11779568_25
Intelligent Computing in Signal Processing and Pattern Recognition
Bin Qian, Ling Wang, De-Xian Huang and Xiong WangLecture Notes in Control and Information Sciences, Intelligent Computing in Signal Processing and Pattern Recognition 345 1125 (2006)
https://doi.org/10.1007/978-3-540-37258-5_146
1234 (2006)
https://doi.org/10.1109/ICIA.2006.305925
Stochastic optimization using simulated annealing with hypothesis test
Ling Wang and Liang ZhangApplied Mathematics and Computation 174 (2) 1329 (2006)
https://doi.org/10.1016/j.amc.2005.05.038
Improvement heuristic for the flow-shop scheduling problem: An adaptive-learning approach
Anurag Agarwal, Selcuk Colak and Enes EryarsoyEuropean Journal of Operational Research 169 (3) 801 (2006)
https://doi.org/10.1016/j.ejor.2004.06.039
An adaptive genetic algorithm with multiple operators for flowshop scheduling
Liang Zhang, Ling Wang and Da-Zhong ZhengThe International Journal of Advanced Manufacturing Technology 27 (5-6) 580 (2006)
https://doi.org/10.1007/s00170-004-2223-3
AI 2006: Advances in Artificial Intelligence
Kang Hu, Jinshu Li, Jing Liu and Licheng JiaoLecture Notes in Computer Science, AI 2006: Advances in Artificial Intelligence 4304 917 (2006)
https://doi.org/10.1007/11941439_98
Genetic ordinal optimisation for stochastic flow shop scheduling
Ling Wang, Liang Zhang and Da-Zhong ZhengThe International Journal of Advanced Manufacturing Technology 27 (1-2) 166 (2005)
https://doi.org/10.1007/s00170-004-2154-z
Advances in Natural Computation
K. Rameshkumar, R. K. Suresh and K. M. MohanasundaramLecture Notes in Computer Science, Advances in Natural Computation 3612 572 (2005)
https://doi.org/10.1007/11539902_70
Some local search algorithms for no-wait flow-shop problem with makespan criterion
Józef Grabowski and Jarosław PemperaComputers & Operations Research 32 (8) 2197 (2005)
https://doi.org/10.1016/j.cor.2004.02.009
Advances in Intelligent Computing
Ling Wang, Hao Wu, Fang Tang and Da-Zhong ZhengLecture Notes in Computer Science, Advances in Intelligent Computing 3645 636 (2005)
https://doi.org/10.1007/11538356_66
A class of hypothesis-test-based genetic algorithms for flow shop scheduling with stochastic processing time
L. Wang, L. Zhang and D.-Z. ZhengThe International Journal of Advanced Manufacturing Technology 25 (11-12) 1157 (2005)
https://doi.org/10.1007/s00170-003-1961-y
A Branch-and-Bound procedure to minimize total tardiness on one machine with arbitrary release dates
Philippe Baptiste, Jacques Carlier and Antoine JougletEuropean Journal of Operational Research 158 (3) 595 (2004)
https://doi.org/10.1016/S0377-2217(03)00378-3
A branch and bound to minimize the number of late jobs on a single machine with release time constraints
Philippe Baptiste, Laurent Peridy and Eric PinsonEuropean Journal of Operational Research 144 (1) 1 (2003)
https://doi.org/10.1016/S0377-2217(01)00353-8
Approximative procedures for no-wait job shop scheduling
Christoph J Schuster and Jose M FraminanOperations Research Letters 31 (4) 308 (2003)
https://doi.org/10.1016/S0167-6377(03)00005-1
The convergence of stochastic algorithms solving flow shop scheduling
K. Steinhöfel, A. Albrecht and C.K. WongTheoretical Computer Science 285 (1) 101 (2002)
https://doi.org/10.1016/S0304-3975(01)00293-6
Evolutionary algorithms for flowshop sequencing with non-unique jobs
R.L. Burdett and E. KozanInternational Transactions in Operational Research 7 (4-5) 401 (2000)
https://doi.org/10.1111/j.1475-3995.2000.tb00207.x
Genetic reinforcement learning approach to the heterogeneous machine scheduling problem
Gyoung Hwan Kim and C.S.G. LeeIEEE Transactions on Robotics and Automation 14 (6) 879 (1998)
https://doi.org/10.1109/70.736772
Design, implementation, and evaluation of the constraint language cc(FD)
Pascal Van Hentenryck, Vijay Saraswat and Yves DevilleThe Journal of Logic Programming 37 (1-3) 139 (1998)
https://doi.org/10.1016/S0743-1066(98)10006-7
A Parallel Algorithm for Production Scheduling
José Francisco Ferreira Ribeiro, Cassilda Maria Ribeiro and Marcio Mattos Borges de OliveiraIFAC Proceedings Volumes 30 (19) 321 (1997)
https://doi.org/10.1016/S1474-6670(17)42319-6
Programação de operações com restrições disjuntivas
Adriana Backx Noronha, José Francisco Ferreira Ribeiro and Cassilda Maria RibeiroGestão & Produção 3 (2) 204 (1996)
https://doi.org/10.1590/S0104-530X1996000200006
Constraint Programming: Basics and Trends
Pascal Hentenryck, Vijay Saraswat and Yves DevilleLecture Notes in Computer Science, Constraint Programming: Basics and Trends 910 293 (1995)
https://doi.org/10.1007/3-540-59155-9_15
Job‐shop scheduling to minimize total waiting time
Chengbin Chu and Marie‐Claude PortmannApplied Stochastic Models and Data Analysis 9 (2) 177 (1993)
https://doi.org/10.1002/asm.3150090210
Les problèmes d'ordonnancement
GothaRAIRO - Operations Research 27 (1) 77 (1993)
https://doi.org/10.1051/ro/1993270100771
Une méthode arborescente pour résoudre les problèmes cumulatifs
Jacques Carlier and Bruno LatapieRAIRO - Operations Research 25 (3) 311 (1991)
https://doi.org/10.1051/ro/1991250303111
A practical use of Jackson's preemptive schedule for solving the job shop problem
J. Carlier and E. PinsonAnnals of Operations Research 26 (1-4) 269 (1990)
https://doi.org/10.1007/BF03543071
Scheduling project networks with resource constraints and time windows
M. Bartusch, R. H. Möhring and F. J. RadermacherAnnals of Operations Research 16 (1) 199 (1988)
https://doi.org/10.1007/BF02283745
Scheduling jobs with release dates and tails on identical machines to minimize the makespan
Jacques CarlierEuropean Journal of Operational Research 29 (3) 298 (1987)
https://doi.org/10.1016/0377-2217(87)90243-8
Un domaine très ouvert : les problèmes d'ordonnancement
J. Carlier and P. ChrétienneRAIRO - Operations Research 16 (3) 175 (1982)
https://doi.org/10.1051/ro/1982160301751