The following pages link to (Q3212909):
Displaying 36 items.
- The proportionate two-machine no-wait job shop scheduling problem (Q322845) (← links)
- NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness (Q337554) (← links)
- Processing time generation schemes for parallel machine scheduling problems with various correlation structures (Q490376) (← links)
- Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness (Q856204) (← links)
- A branch and bound algorithm of the single machine schedule with sequence dependent setup times for minimizing total tardiness (Q864814) (← links)
- A branch-and-bound algorithm of the single machine schedule with sequence-dependent setup times for minimizing maximum tardiness (Q869149) (← links)
- Job oriented production scheduling (Q915631) (← links)
- Theoretical aspects of multicriteria flight gate scheduling: Deterministic and fuzzy models (Q983626) (← links)
- Polynomial time algorithms for two special classes of the proportionate multiprocessor open shop (Q1038327) (← links)
- Single-machine scheduling with learning considerations (Q1124688) (← links)
- Solving a bicriterion scheduling problem (Q1131944) (← links)
- Characterizing the set of feasible sequences for n jobs to be carried out on a single machine (Q1135762) (← links)
- Single machine sequencing with nonlinear multicriteria cost functions: An application of generalized dynamic programming (Q1185994) (← links)
- An efficient heuristic approach to the scheduling of jobs in a flowshop (Q1194720) (← links)
- Four solution techniques for a general one machine scheduling problem. A comparative study (Q1247365) (← links)
- Complexity of single machine, multi-criteria scheduling problems (Q1309989) (← links)
- Scheduling in a sequence dependent setup environment with genetic search (Q1342322) (← links)
- Flowshop scheduling with dominant machines (Q1342341) (← links)
- Assignment of a job load in a distributed system: A multicriteria design method (Q1390284) (← links)
- A bicriteria approach to the two-machine flow shop scheduling problem (Q1807949) (← links)
- Scheduling unit processing time jobs on a single machine with multiple criteria (Q1823849) (← links)
- An \(O(n^{2})\) algorithm for the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines (Q1926814) (← links)
- A BB\&R algorithm for minimizing total tardiness on a single machine with sequence dependent setup times (Q1928272) (← links)
- Proportionate flowshops with general position-dependent processing times (Q1944066) (← links)
- Online scheduling of ordered flow shops (Q1991105) (← links)
- Minmax scheduling and due-window assignment with position-dependent processing times and job rejection (Q2026708) (← links)
- Grouping products for the optimization of production processes: a case in the steel manufacturing industry (Q2184105) (← links)
- Makespan minimization for the \(m\)-machine ordered flow shop scheduling problem (Q2273694) (← links)
- Parallel machine makespan minimization subject to machine availability and total completion time constraints (Q2304115) (← links)
- Minimizing total tardiness in parallel machine scheduling with setup times: an adaptive memory-based GRASP approach (Q2370333) (← links)
- Scatter search for minimizing weighted tardiness in a single machine scheduling with setups (Q2403268) (← links)
- Algorithms for single machine total tardiness scheduling with sequence dependent setups (Q2433437) (← links)
- The significance of reducing setup times/setup costs (Q2467248) (← links)
- Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups (Q2468493) (← links)
- Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness (Q2563893) (← links)
- Complexity of two dual criteria scheduling problems (Q2643797) (← links)
