The following pages link to (Q4124332):
Displaying 50 items.
- Exact algorithms for single-machine scheduling with time windows and precedence constraints (Q310349) (← links)
- Minimising total tardiness for a single machine scheduling problem with family setups and resource constraints (Q320637) (← links)
- Optimal restricted due date assignment in scheduling (Q322834) (← links)
- Scheduling two job families on a single machine with two competitive agents (Q326478) (← links)
- Exact and heuristic procedures for single machine scheduling with quadratic earliness and tardiness penalties (Q336376) (← links)
- A study of hybrid evolutionary algorithms for single machine scheduling problem with sequence-dependent setup times (Q337074) (← links)
- Weighted tardiness for the single machine scheduling problem:an examination of precedence theorem productivity (Q339549) (← links)
- A theoretical development for the total tardiness problem and its application in branch and bound algorithms (Q339575) (← links)
- An investigation on a two-agent single-machine scheduling problem with unequal release dates (Q339650) (← links)
- Bi-criteria sequencing of courses and formation of classes for a bottleneck classroom (Q342113) (← links)
- Single machine total tardiness maximization problems: complexity and algorithms (Q367638) (← links)
- A note on reverse scheduling with maximum lateness objective (Q398863) (← links)
- Iterated local search for single-machine scheduling with sequence-dependent setup times to minimize total weighted tardiness (Q398925) (← links)
- Neighborhood search procedures for single machine tardiness scheduling with sequence-dependent setups (Q428876) (← links)
- A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects (Q497951) (← links)
- Single machine scheduling problems with financial resource constraints: some complexity results and properties (Q554491) (← links)
- A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates (Q596267) (← links)
- Algorithms for some maximization scheduling problems on a single machine (Q612210) (← links)
- Single CNC machine scheduling with controllable processing times to minimize total weighted tardiness (Q613514) (← links)
- Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems (Q621754) (← links)
- Minimizing total weighted tardiness on a single machine with release dates and equal-length jobs (Q633558) (← links)
- A multi-start dynasearch algorithm for the time dependent single-machine total weighted tardiness scheduling problem (Q707153) (← links)
- Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment (Q709154) (← links)
- Algorithms for special cases of the single machine total tardiness problem and an application to the even-odd partition problem (Q732689) (← links)
- A note on a single machine scheduling problem with generalized total tardiness objective function (Q763495) (← links)
- New directions in scheduling theory (Q786649) (← links)
- Mathematical programming formulations for machine scheduling: A survey (Q811337) (← links)
- The coordination of scheduling and batch deliveries (Q816348) (← links)
- A branch, bound, and remember algorithm for the \(1|r _{i }|\sum t _{i }\) scheduling problem (Q842556) (← links)
- A tabu search algorithm for the single machine total weighted tardiness problem (Q853020) (← links)
- Some remarks on the decomposition properties of the single machine total tardiness problem (Q856256) (← links)
- Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops (Q857354) (← links)
- A branch and bound algorithm to minimize the total tardiness for \(m\)-machine permutation flowshop problems (Q858325) (← links)
- A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date (Q861263) (← links)
- Two due date assignment problems in scheduling a single machine (Q867932) (← links)
- An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups (Q868130) (← links)
- Hybrid backward and forward dynamic programming based Lagrangian relaxation for single machine scheduling (Q875408) (← links)
- Minimizing total earliness and tardiness on a single machine using a hybrid heuristic (Q878591) (← links)
- Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach (Q883312) (← links)
- A controlled search simulated annealing method for the single machine weighted tardiness problem (Q918386) (← links)
- Comparing efficiencies of genetic crossover operators for one machine total weighted tardiness problem (Q928082) (← links)
- Efficient algorithms for machine scheduling problems with earliness and tardiness penalties (Q940876) (← links)
- A hybrid algorithm for the single-machine total tardiness problem (Q954025) (← links)
- A faster fully polynomial approximation scheme for the single-machine total tardiness problem (Q958114) (← links)
- Single-machine scheduling under the job rejection constraint (Q964407) (← links)
- A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times (Q1000975) (← links)
- A population-based variable neighborhood search for the single machine total weighted tardiness problem (Q1001005) (← links)
- Scheduling jobs with agreeable processing times and due dates on a single batch processing machine (Q1022597) (← links)
- Preemptive scheduling of jobs with agreeable due dates on a single machine to minimize total tardiness (Q1038111) (← links)
- The single-machine total tardiness scheduling problem: review and extensions (Q1038369) (← links)
