Using mixed graph coloring to minimize total completion time in job shop scheduling
DOI10.1016/J.AMC.2006.04.063zbMATH Open1114.90033OpenAlexW2063077151WikidataQ57717981 ScholiaQ57717981MaRDI QIDQ858768FDOQ858768
Yuri N. Sotskov, Fawaz S. Al-Anzi, George V. Andreev, Ali Allahverdi
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
Recommendations
- scientific article; zbMATH DE number 1731177
- scientific article; zbMATH DE number 1594564
- 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
- Scheduling Problems and Mixed Graph Colorings
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Graph colorings with local constraints -- a survey
- NP-hardness of shop-scheduling problems with three jobs
- A graph coloring algorithm for large scheduling problems
- Unit Execution Time Shop Problems
- The complexity of shop-scheduling problems with two or three jobs
- An introduction to timetabling
- Mixed graph colorings
- Scheduling Problems and Mixed Graph Colorings
- Preemptive job-shop scheduling problems with a fixed number of jobs
- An efficient algorithm for the job-shop problem with two jobs
- Total completion time minimization in two-machine job shops with unit-time operations
- Is a unit-job shop not easier than identical parallel machines?
- Title not available (Why is that?)
- A Geometric Model and a Graphical Algorithm for a Sequencing Problem
Cited In (11)
- Title not available (Why is that?)
- Parameterized mixed graph coloring
- Fuzzy colouring of fuzzy graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- A makespan-optimal schedule for processing jobs with possible operation preemptions as an optimal mixed graph coloring
- A bi-objective branch-and-bound algorithm for the unit-time job shop scheduling: a mixed graph coloring approach
- A matrix approach to hypergraph stable set and coloring problems with its application to storing problem
- Mixed graph colouring as scheduling multi-processor tasks with equal processing times
- Mixed graph edge coloring
- Vyacheslav Tanaev: contributions to scheduling and related areas
This page was built for publication: Using mixed graph coloring to minimize total completion time in job shop scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q858768)
