Complexity of single machine hierarchical scheduling: A survey
From MaRDI portal
Cited in
(27)- A multi-population genetic algorithm to solve multi-objective scheduling problems for parallel machines.
- Minimizing makespan subject to minimum total flow-time on identical parallel machines
- Scheduling with time-dependent discrepancy times
- A note on proving the strong NP-hardness of some scheduling problems with start time dependent job processing times
- Using genetic algorithms for single-machine bicriteria scheduling problems
- Two-machine flow shop scheduling with two criteria: maximum earliness and makespan
- A note on proving the strong NP-hardness of a scheduling problem with position dependent job processing times
- Proportionate flow shop with controllable processing times
- Scheduling to tradeoff between the number and the length of accepted jobs
- Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs
- Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem with availability constraint
- Bicriteria hierarchical optimization of two-machine flow shop scheduling problem with time-dependent deteriorating jobs
- Generating efficient schedules for identical parallel machines involving flow-time and tardy jobs
- Pareto and scalar bicriterion optimization in scheduling deteriorating jobs
- Multicriteria scheduling problems: a survey
- MP or not MP: that is the question
- A survey of single machine scheduling to minimize weighted number of tardy jobs
- Minimizing makespan subject to minimum flowtime on two identical parallel machines
- Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work
- Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem
- On the complexity of bi-criteria scheduling on a single batch processing machine
- Single-machine primary-secondary scheduling with total tardiness being the primary criterion
- Uniform parallel machine scheduling problems with fixed machine cost
- Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness
- Bicriterion scheduling with equal processing times on a batch processing machine
- Single-machine scheduling under the job rejection constraint
- Genetic algorithm for bi-criteria single machine scheduling problem of minimizing maximum earliness and number of tardy jobs
This page was built for publication: Complexity of single machine hierarchical scheduling: A survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2743969)
