Details

Title

Scheduling of unit-length jobs with bipartite incompatibility graphs on four uniform machines

Journal title

Bulletin of the Polish Academy of Sciences: Technical Sciences

Yearbook

2017

Volume

65

Numer

No 1

Authors

Divisions of PAS

Nauki Techniczne

Coverage

29-34

Date

2017

Identifier

DOI: 10.1515/bpasts-2017-0004 ; ISSN 2300-1917

Source

Bulletin of the Polish Academy of Sciences: Technical Sciences; 2017; 65; No 1; 29-34

References

Chen (2012), Equitable Δ - coloring of graphs, Disc Math, 312. ; Furmańczyk (2016), Scheduling of unit - length jobs with cubic Incompatibility graphs on three uniform machines in print available online Feb, Disc Appl Math, doi.org/10.1016/j.dam.2016.01.036 ; Boudhar (2005), Scheduling on a batch processing machine with split compatibility graphs, Math Modell Algorithms, 391, doi.org/10.1007/s10852-005-3083-z ; Hopcroft (1973), An algorithm for maximum matchings in bipartite graphs, SIAM J Comput, 5, 2. ; Kubale (1989), Interval vertex - coloring of a graph with forbidden colors, Disc Math, 74. ; Li (2014), Serial batch scheduling on uniform parallel machines to minimize total completion time, Process Lett, 114. ; Finke (2008), Batch processing with interval graph compatibilities between tasks, Disc Appl Math, 156. ; Boudhar (2003), Scheduling a batch processing machine with bipartite compatibility graphs, Math Methods Oper Res, 57. ; Werra (2005), de A hypocoloring model for batch scheduling, Disc Appl Math, 146.
×