Two-machine flow-shop scheduling to minimize total late work: revisited
From MaRDI portal
(Redirected from Publication:5059191)
Recommendations
- The two-machine flow-shop problem with weighted late work criterion and common due date
- Dominance relations for two-machine flow shop problem with late work criterion
- Minimizing tardiness in a two-machine flow-shop
- The two-machine flowshop scheduling problem with total tardiness
- Two-machine flowshop scheduling to minimize total tardiness
Cites work
- A hybrid discrete teaching-learning based meta-heuristic for solving no-idle flow shop scheduling problem with total tardiness criterion
- A note on the two machine job shop with the weighted late work criterion
- A two-agent single-machine scheduling problem with late work criteria
- Approximation schemes for single-machine scheduling with a fixed maintenance activity to minimize the total amount of late work
- Group scheduling with deteriorating jobs and allotted resource under limited resource availability constraint
- scientific article; zbMATH DE number 3902030 (Why is no real title available?)
- scientific article; zbMATH DE number 2109192 (Why is no real title available?)
- Improved mixed-integer linear programming model and heuristics for bi-objective single-machine batch scheduling with energy cost consideration
- KI 2005: Advances in Artificial Intelligence
- Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date
- Minimizing mean weighted execution time loss on identical and uniform processors
- Open shop scheduling problems with late work criteria.
- Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work
- Scheduling jobs with controllable processing time, truncated job-dependent learning and deterioration effects
- Scheduling on parallel identical machines with late work criterion: offline and online cases
- Single Machine Scheduling to Minimize Total Late Work
- The complexity of two supply chain scheduling problems
- The two-machine flow-shop problem with weighted late work criterion and common due date
Cited in
(14)- Minimizing the number of late jobs for the two-machine unit-time job-shop scheduling problem
- Minimizing total late work on a single machine with generalized due-dates
- Two-machine flow shop scheduling with a common due date to maximize total early work
- Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date
- Scheduling with competing agents, total late work and job rejection
- Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work
- scientific article; zbMATH DE number 4001854 (Why is no real title available?)
- Scheduling with a position-weighted learning effect and job release dates
- KI 2005: Advances in Artificial Intelligence
- A no-delay single machine scheduling problem to minimize total weighted early and late work
- Maximizing total early work in a distributed two‐machine flow‐shop
- A new perspective on single-machine scheduling problems with late work related criteria
- Dominance relations for two-machine flow shop problem with late work criterion
- A note on the two machine job shop with the weighted late work criterion
This page was built for publication: Two-machine flow-shop scheduling to minimize total late work: revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5059191)
