Pages that link to "Item:Q620080"
From MaRDI portal
The following pages link to Dominance relations for two-machine flow shop problem with late work criterion (Q620080):
Displaying 13 items.
- A note on the two machine job shop with the weighted late work criterion (Q880589) (← links)
- Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work (Q1673940) (← links)
- A two-agent single-machine scheduling problem with late work criteria (Q1701708) (← links)
- Scheduling on parallel identical machines with late work criterion: offline and online cases (Q1702733) (← links)
- The two-machine flow-shop problem with weighted late work criterion and common due date (Q1772844) (← links)
- A better dominance relation and heuristics for two-machine no-wait flowshops with maximum lateness performance measure (Q1983744) (← links)
- Minimizing total late work on a single machine with generalized due-dates (Q2030324) (← links)
- Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date (Q2301935) (← links)
- Complexity of scheduling problem in single-machine flexible manufacturing system with cyclic transportation and unlimited buffers (Q2412847) (← links)
- (Q3023686) (← links)
- Un nouveau concept de dominance pour l'ordonnancement de travaux sur une machine (Q3686481) (← links)
- A Branch-and-Bound Algorithm for Two-Agent Scheduling with Learning Effect and Late Work Criterion (Q4689397) (← links)
- Two-machine flow-shop scheduling to minimize total late work: revisited (Q5059191) (← links)
