Using mixed graph coloring to minimize total completion time in job shop scheduling
From MaRDI portal
Publication:858768
DOI10.1016/j.amc.2006.04.063zbMath1114.90033OpenAlexW2063077151WikidataQ57717981 ScholiaQ57717981MaRDI QIDQ858768
Fawaz S. Al-Anzi, George V. Andreev, Ali Allahverdi, Yuri N. Sotskov
Publication date: 11 January 2007
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2006.04.063
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Related Items (8)
A bi-objective branch-and-bound algorithm for the unit-time job shop scheduling: a mixed graph coloring approach ⋮ A makespan-optimal schedule for processing jobs with possible operation preemptions as an optimal mixed graph coloring ⋮ Parameterized mixed graph coloring ⋮ Vyacheslav Tanaev: contributions to scheduling and related areas ⋮ Unnamed Item ⋮ Mixed graph edge coloring ⋮ A matrix approach to hypergraph stable set and coloring problems with its application to storing problem ⋮ Fuzzy colouring of fuzzy graphs
Cites Work
- Unnamed Item
- An introduction to timetabling
- An efficient algorithm for the job-shop problem with two jobs
- The complexity of shop-scheduling problems with two or three jobs
- Total completion time minimization in two-machine job shops with unit-time operations
- Preemptive job-shop scheduling problems with a fixed number of jobs
- Mixed graph colorings
- Is a unit-job shop not easier than identical parallel machines?
- NP-hardness of shop-scheduling problems with three jobs
- Scheduling Problems and Mixed Graph Colorings
- A graph coloring algorithm for large scheduling problems
- Unit Execution Time Shop Problems
- Graph colorings with local constraints -- a survey
- A Geometric Model and a Graphical Algorithm for a Sequencing Problem
This page was built for publication: Using mixed graph coloring to minimize total completion time in job shop scheduling
