Multi-coloring and job-scheduling with assignment and incompatibility costs
Author
Abstract
Suggested Citation
DOI: 10.1007/s10479-013-1397-1
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Lü, Zhipeng & Hao, Jin-Kao, 2010. "A memetic algorithm for graph coloring," European Journal of Operational Research, Elsevier, vol. 203(1), pages 241-250, May.
- Kolisch, R. & Padman, R., 2001.
"An integrated survey of deterministic project scheduling,"
Omega, Elsevier, vol. 29(3), pages 249-272, June.
- Kolisch, Rainer & Padman, R., 2001. "An integrated survey of deterministic project scheduling," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 8114, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
- M Plumettaz & D Schindl & N Zufferey, 2010. "Ant Local Search and its efficient adaptation to graph colouring," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(5), pages 819-826, May.
- Nicolas Zufferey & Olivier Labarthe & David Schindl, 2012. "Heuristics for a project management problem with incompatibility and assignment costs," Computational Optimization and Applications, Springer, vol. 51(3), pages 1231-1252, April.
- Guoqing Wang & Hongyi Sun & Chengbin Chu, 2005. "Preemptive Scheduling with Availability Constraints to Minimize Total Weighted Completion Times," Annals of Operations Research, Springer, vol. 133(1), pages 183-192, January.
- Enrico Malaguti & Michele Monaci & Paolo Toth, 2008. "A Metaheuristic Approach for the Vertex Coloring Problem," INFORMS Journal on Computing, INFORMS, vol. 20(2), pages 302-316, May.
- György Dósa & Yong He, 2006. "Scheduling with machine cost and rejection," Journal of Combinatorial Optimization, Springer, vol. 12(4), pages 337-350, December.
- Edmund Burke & Jakub Mareček & Andrew Parkes & Hana Rudová, 2010. "A supernodal formulation of vertex colouring with applications in course timetabling," Annals of Operations Research, Springer, vol. 179(1), pages 105-130, September.
- Slotnick, Susan A., 2011. "Order acceptance and scheduling: A taxonomy and review," European Journal of Operational Research, Elsevier, vol. 212(1), pages 1-11, July.
- Guang Feng & Hoong Lau, 2008. "Efficient algorithms for machine scheduling problems with earliness and tardiness penalties," Annals of Operations Research, Springer, vol. 159(1), pages 83-95, March.
- J. Beck & Philippe Refalo, 2003. "A Hybrid Approach to Scheduling with Earliness and Tardiness Costs," Annals of Operations Research, Springer, vol. 118(1), pages 49-71, February.
- Philippe Galinier & Jin-Kao Hao, 1999. "Hybrid Evolutionary Algorithms for Graph Coloring," Journal of Combinatorial Optimization, Springer, vol. 3(4), pages 379-397, December.
- Zhi-Long Chen, 2004. "Simultaneous Job Scheduling and Resource Allocation on Parallel Machines," Annals of Operations Research, Springer, vol. 129(1), pages 135-153, July.
- Zorzini, M. & Corti, D. & Pozzetti, A., 2008. "Due date (DD) quotation and capacity planning in make-to-order companies: Results from an empirical analysis," International Journal of Production Economics, Elsevier, vol. 112(2), pages 919-933, April.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Simon Thevenin & Nicolas Zufferey & Jean-Yves Potvin, 2017. "Makespan minimisation for a parallel machine scheduling problem with preemption and job incompatibility," International Journal of Production Research, Taylor & Francis Journals, vol. 55(6), pages 1588-1606, March.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Nicolas Zufferey & Olivier Labarthe & David Schindl, 2012. "Heuristics for a project management problem with incompatibility and assignment costs," Computational Optimization and Applications, Springer, vol. 51(3), pages 1231-1252, April.
- Simon Thevenin & Nicolas Zufferey & Marino Widmer, 2016. "Order acceptance and scheduling with earliness and tardiness penalties," Journal of Heuristics, Springer, vol. 22(6), pages 849-890, December.
- Olawale Titiloye & Alan Crispin, 2012. "Parameter Tuning Patterns for Random Graph Coloring with Quantum Annealing," PLOS ONE, Public Library of Science, vol. 7(11), pages 1-9, November.
- Alex Gliesch & Marcus Ritt, 2022. "A new heuristic for finding verifiable k-vertex-critical subgraphs," Journal of Heuristics, Springer, vol. 28(1), pages 61-91, February.
- Raja Marappan & Gopalakrishnan Sethumadhavan, 2020. "Complexity Analysis and Stochastic Convergence of Some Well-known Evolutionary Operators for Solving Graph Coloring Problem," Mathematics, MDPI, vol. 8(3), pages 1-20, February.
- M Plumettaz & D Schindl & N Zufferey, 2010. "Ant Local Search and its efficient adaptation to graph colouring," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(5), pages 819-826, May.
- Renatha Capua & Yuri Frota & Luiz Satoru Ochi & Thibaut Vidal, 2018. "A study on exponential-size neighborhoods for the bin packing problem with conflicts," Journal of Heuristics, Springer, vol. 24(4), pages 667-695, August.
- Hawa, Asyl L. & Lewis, Rhyd & Thompson, Jonathan M., 2022. "Exact and approximate methods for the score-constrained packing problem," European Journal of Operational Research, Elsevier, vol. 302(3), pages 847-859.
- Brachmann, Robert & Kolisch, Rainer, 2021. "The impact of flexibility on engineer-to-order production planning," International Journal of Production Economics, Elsevier, vol. 239(C).
- Lü, Zhipeng & Hao, Jin-Kao, 2010. "A memetic algorithm for graph coloring," European Journal of Operational Research, Elsevier, vol. 203(1), pages 241-250, May.
- Severino F. Galán, 2017. "Simple decentralized graph coloring," Computational Optimization and Applications, Springer, vol. 66(1), pages 163-185, January.
- Casado, Silvia & Laguna, Manuel & Pacheco, Joaquín & Puche, Julio C., 2020. "Grouping products for the optimization of production processes: A case in the steel manufacturing industry," European Journal of Operational Research, Elsevier, vol. 286(1), pages 190-202.
- Albert E. Fernandes Muritiba & Manuel Iori & Enrico Malaguti & Paolo Toth, 2010. "Algorithms for the Bin Packing Problem with Conflicts," INFORMS Journal on Computing, INFORMS, vol. 22(3), pages 401-415, August.
- Iztok Fister & Marjan Mernik & Bogdan Filipič, 2013. "Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm," Computational Optimization and Applications, Springer, vol. 54(3), pages 741-770, April.
- Olivier Guyon & Pierre Lemaire & Éric Pinson & David Rivreau, 2014. "Solving an integrated job-shop problem with human resource constraints," Annals of Operations Research, Springer, vol. 213(1), pages 147-171, February.
- Alarcón, F. & Alemany, M.M.E. & Ortiz, A., 2009. "Conceptual framework for the characterization of the order promising process in a collaborative selling network context," International Journal of Production Economics, Elsevier, vol. 120(1), pages 100-114, July.
- Andrzej Kozik, 2017. "Handling precedence constraints in scheduling problems by the sequence pair representation," Journal of Combinatorial Optimization, Springer, vol. 33(2), pages 445-472, February.
- Xiong, Jian & Leus, Roel & Yang, Zhenyu & Abbass, Hussein A., 2016. "Evolutionary multi-objective resource allocation and scheduling in the Chinese navigation satellite system project," European Journal of Operational Research, Elsevier, vol. 251(2), pages 662-675.
- Wang, Xiuli & Cheng, T.C.E., 2015. "A heuristic for scheduling jobs on two identical parallel machines with a machine availability constraint," International Journal of Production Economics, Elsevier, vol. 161(C), pages 74-82.
- Vega-Velázquez, Miguel Ángel & García-Nájera, Abel & Cervantes, Humberto, 2018. "A survey on the Software Project Scheduling Problem," International Journal of Production Economics, Elsevier, vol. 202(C), pages 145-161.
More about this item
Keywords
Job-scheduling; Multi-coloring; Tabu search; Genetic algorithm;All these keywords.
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:211:y:2013:i:1:p:83-101:10.1007/s10479-013-1397-1. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.