Multi-coloring and job-scheduling with assignment and incompatibility costs

DOI10.1007/s10479-013-1397-1zbMath1286.90052OpenAlexW1991413540MaRDI QIDQ2449346

Nicolas Zufferey, Ivo Blöchliger

Publication date: 8 May 2014

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://archive-ouverte.unige.ch/unige:37815

zbMATH Keywords

tabu searchgenetic algorithmjob-schedulingmulti-coloring

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (2)

Graph multi-coloring for a job scheduling application ⋮ Storage Yard Management: Modelling and Solving

Uses Software

• CALMA
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Heuristics for a project management problem with incompatibility and assignment costs
• Using tabu search techniques for graph coloring
• Simultaneous job scheduling and resource allocation on parallel machines
• A supernodal formulation of vertex colouring with applications in course timetabling
• Graph colouring approaches for a satellite range scheduling problem
• Efficient algorithms for machine scheduling problems with earliness and tardiness penalties
• Variable space search for graph coloring
• A memetic algorithm for graph coloring
• Project scheduling. A research handbook.
• Scheduling with job release dates, delivery times and preemption penalties
• Preemptive scheduling with availability constraints to minimize total weighted completion times
• A hybrid approach to scheduling with earliness and tardiness costs
• A heuristic approach for minimizing weighted tardiness and overtime costs in single resource scheduling
• Metaheuristics: A bibliography
• Probabilistic diversification and intensification in local search for vehicle routing
• Hybrid evolutionary algorithms for graph coloring
• Scheduling with machine cost and rejection
• A graph coloring heuristic using partial solutions and a reactive tabu scheme
• Due date assignments and scheduling a single machine with a general earliness/tardiness cost function
• Multicriteria scheduling problems: a survey
• A Metaheuristic Approach for the Vertex Coloring Problem
• A survey on vertex coloring problems
• Evolutionary algorithms applied to project scheduling problems—a survey of the state-of-the-art
• Ant Local Search and its efficient adaptation to graph colouring
• Scheduling File Transfers
• A graph coloring algorithm for large scheduling problems
• New methods to color the vertices of a graph
• Approximation and Online Algorithms
• Scheduling
• Models and solution techniques for frequency assignment problems

This page was built for publication: Multi-coloring and job-scheduling with assignment and incompatibility costs