Makespan minimisation for a parallel machine scheduling problem with preemption and job incompatibility
Published 2016 View Full Article
- Home
- Publications
- Publication Search
- Publication Details
Title
Makespan minimisation for a parallel machine scheduling problem with preemption and job incompatibility
Authors
Keywords
-
Journal
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
Volume 55, Issue 6, Pages 1588-1606
Publisher
Informa UK Limited
Online
2016-05-09
DOI
10.1080/00207543.2016.1181285
References
Ask authors/readers for more resources
Related references
Note: Only part of the references are listed.- A Generalized Consistent Neighborhood Search for Satellite Range Scheduling Problems
- (2014) Nicolas Zufferey et al. RAIRO-OPERATIONS RESEARCH
- Multi-coloring and job-scheduling with assignment and incompatibility costs
- (2013) Ivo Blöchliger et al. ANNALS OF OPERATIONS RESEARCH
- Scheduling jobs on identical machines with agreement graph
- (2011) Mohamed Bendraouche et al. COMPUTERS & OPERATIONS RESEARCH
- Synchronisation of scarce resources for a parallel machine lotsizing problem
- (2011) Christian Almeder et al. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
- Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem
- (2011) Flavia Bonomo et al. THEORETICAL COMPUTER SCIENCE
- Heuristics for a project management problem with incompatibility and assignment costs
- (2010) Nicolas Zufferey et al. COMPUTATIONAL OPTIMIZATION AND APPLICATIONS
- Lexicographic optimisation for optimal departure aircraft trajectories
- (2009) Xavier Prats et al. AEROSPACE SCIENCE AND TECHNOLOGY
- A survey of scheduling with deterministic machine availability constraints
- (2009) Ying Ma et al. COMPUTERS & INDUSTRIAL ENGINEERING
- A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints
- (2009) K. Giaro et al. DISCRETE APPLIED MATHEMATICS
- Solving a multicoloring problem with overlaps using integer programming
- (2009) Isabel Méndez-Díaz et al. DISCRETE APPLIED MATHEMATICS
- Scheduling incompatible tasks on two machines
- (2009) Irina N. Lushchakova et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- A memetic algorithm for graph coloring
- (2009) Zhipeng Lü et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- A survey on vertex coloring problems
- (2009) Enrico Malaguti et al. International Transactions in Operational Research
- Mutual exclusion scheduling with interval graphs or related classes, Part I
- (2008) Frédéric Gardi DISCRETE APPLIED MATHEMATICS
- Adaptive Tabu Search for course timetabling
- (2008) Zhipeng Lü et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- Scheduling with conflicts: online and offline algorithms
- (2008) Guy Even et al. JOURNAL OF SCHEDULING
- Generalised graph colouring by a hybrid of local search and constraint programming
- (2007) Steven Prestwich DISCRETE APPLIED MATHEMATICS
- An adaptive memory algorithm for the k-coloring problem
- (2007) Philippe Galinier et al. DISCRETE APPLIED MATHEMATICS
- The car sequencing problem: Overview of state-of-the-art methods and industrial case-study of the ROADEF’2005 challenge problem
- (2007) Christine Solnon et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- A graph coloring heuristic using partial solutions and a reactive tabu scheme
- (2006) Ivo Blöchliger et al. COMPUTERS & OPERATIONS RESEARCH
- Balancing assembly line with skilled and unskilled workers
- (2006) Albert Corominas et al. OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE
Find Funding. Review Successful Grants.
Explore over 25,000 new funding opportunities and over 6,000,000 successful grants.
ExploreAdd your recorded webinar
Do you already have a recorded webinar? Grow your audience and get more views by easily listing your recording on Peeref.
Upload Now