Dominance relations for two-machine flow shop problem with late work criterion
From MaRDI portal
Publication:620080
zbMath1203.90074MaRDI QIDQ620080
Publication date: 19 January 2011
Published in: Bulletin of the Polish Academy of Sciences. Technical Sciences (Search for Journal in Brave)
Full work available at URL: http://bulletin.pan.pl/(55-1)59.html
Related Items (7)
Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work ⋮ Complexity of scheduling problem in single-machine flexible manufacturing system with cyclic transportation and unlimited buffers ⋮ A two-agent single-machine scheduling problem with late work criteria ⋮ Scheduling on parallel identical machines with late work criterion: offline and online cases ⋮ Minimizing total late work on a single machine with generalized due-dates ⋮ A Branch-and-Bound Algorithm for Two-Agent Scheduling with Learning Effect and Late Work Criterion ⋮ Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date
This page was built for publication: Dominance relations for two-machine flow shop problem with late work criterion
