Pages that link to "Item:Q1772844"
From MaRDI portal
The following pages link to The two-machine flow-shop problem with weighted late work criterion and common due date (Q1772844):
Displaying 24 items.
- A note on ``Two-machine flow-shop scheduling with rejection'' and its link with flow-shop scheduling and common due date assignment (Q339677) (← links)
- Dominance relations for two-machine flow shop problem with late work criterion (Q620080) (← links)
- Semi-online scheduling on two identical machines with a common due date to maximize total early work (Q827603) (← links)
- A multi-objective particle swarm for a flow shop scheduling problem (Q867030) (← links)
- A note on the two machine job shop with the weighted late work criterion (Q880589) (← links)
- Open shop scheduling problems with late work criteria. (Q1421458) (← links)
- On the exact solution of the no-wait flow shop problem with due date constraints (Q1652232) (← links)
- Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work (Q1673940) (← links)
- Scheduling on parallel identical machines with late work criterion: offline and online cases (Q1702733) (← links)
- Minimizing total weighted late work in the resource-constrained project scheduling problem (Q1792320) (← links)
- Minimizing total late work on a single machine with generalized due-dates (Q2030324) (← links)
- Optimally rescheduling jobs with a last-in-first-out buffer (Q2066687) (← links)
- Single-machine Pareto-scheduling with multiple weighting vectors for minimizing the total weighted late works (Q2083387) (← links)
- Two-machine flow shop scheduling with a common due date to maximize total early work (Q2116855) (← links)
- A common approximation framework for early work, late work, and resource leveling problems (Q2184097) (← links)
- Single-machine scheduling with multi-agents to minimize total weighted late work (Q2197329) (← links)
- Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date (Q2301935) (← links)
- Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date (Q2384909) (← links)
- Scheduling with competing agents, total late work and job rejection (Q2668778) (← links)
- Two-machine flow-shop scheduling to minimize total late work: revisited (Q5059191) (← links)
- Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work (Q6077487) (← links)
- Maximizing total early work in a distributed two‐machine flow‐shop (Q6078603) (← links)
- Exact approaches to late work scheduling on unrelated machines (Q6093431) (← links)
- A note on multimachine scheduling with weighted early/late work criteria and common due date (Q6484280) (← links)
