Dominance relations for two-machine flow shop problem with late work criterion

MaRDI QIDQ620080zbMATH OpenFDO

Authors Małgorzata Sterna

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

zbMATH Keywords

dominance relationflow shoplate work criterionscheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• The two-machine flow-shop problem with weighted late work criterion and common due date
• Two-machine flow-shop scheduling to minimize total late work: revisited
• Two-machine flow shop scheduling with nonregular criteria
• A note on the two machine job shop with the weighted late work criterion
• Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date

Cited in

(14)

• Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work
• A two-agent single-machine scheduling problem with late work criteria
• Scheduling on parallel identical machines with late work criterion: offline and online cases
• The two-machine flow-shop problem with weighted late work criterion and common due date
• A better dominance relation and heuristics for two-machine no-wait flowshops with maximum lateness performance measure
• Minimizing total late work on a single machine with generalized due-dates
• Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date
• Complexity of scheduling problem in single-machine flexible manufacturing system with cyclic transportation and unlimited buffers
• scientific article; zbMATH DE number 2186529 (Why is no real title available?)
• Un nouveau concept de dominance pour l'ordonnancement de travaux sur une machine
• A branch-and-bound algorithm for two-agent scheduling with learning effect and late work criterion
• Two-machine flow-shop scheduling to minimize total late work: revisited
• KI 2005: Advances in Artificial Intelligence
• A note on the two machine job shop with the weighted late work criterion

This page was built for publication: Dominance relations for two-machine flow shop problem with late work criterion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q620080)