The following pages link to (Q4124332):
Displaying 50 items.
- A new dynamic programming formulation for scheduling independent tasks with common due date on parallel machines (Q1040984) (← links)
- Non-approximability of just-in-time scheduling (Q1041346) (← links)
- Dynamic programming and decomposition approaches for the single machine total tardiness problem (Q1092805) (← links)
- Complexity results for scheduling chains on a single machine (Q1142687) (← links)
- On the complexity of generalized due date scheduling problems (Q1175769) (← links)
- Some new efficient methods to solve the \(n/1/r_ i/\sum{}T_ i\) scheduling problem (Q1197646) (← links)
- A polynomial algorithm for an integer quadratic non-separable transportation problem (Q1198737) (← links)
- A guaranteed accuracy shifting bottleneck algorithm for the two-machine flowshop total tardiness problem (Q1265840) (← links)
- A strategy for evolution of algorithms to increase the computational effectiveness of NP-hard scheduling problems (Q1266611) (← links)
- Scheduling jobs on parallel machines with sequence-dependent setup times (Q1278125) (← links)
- A note on the equivalence of two heuristics to minimize total tardiness (Q1278526) (← links)
- Evaluation of leading heuristics for the single machine tardiness problem (Q1278530) (← links)
- Single machine earliness and tardiness scheduling (Q1278531) (← links)
- Scheduling about a common due date with job-dependent asymmetric earlines and tardiness penalties (Q1278719) (← links)
- A heuristic for the single machine tardiness problem (Q1310015) (← links)
- A greedy heuristic for the mean tardiness sequencing problem (Q1317079) (← links)
- Decomposition of the single machine total tardiness problem (Q1362989) (← links)
- Scheduling parallel machines to minimize total weighted and unweighted tardiness (Q1370670) (← links)
- General stochastic single-machine scheduling with regular cost functions (Q1381780) (← links)
- Is a unit-job shop not easier than identical parallel machines? (Q1392555) (← links)
- Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity (Q1399579) (← links)
- A new lower bounding scheme for the total weighted tardiness problem. (Q1406617) (← links)
- An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem (Q1433664) (← links)
- Parallel machine scheduling with a common server (Q1566574) (← links)
- Distributionally robust single machine scheduling with the total tardiness criterion (Q1628037) (← links)
- A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization (Q1628126) (← links)
- Decomposition methods for cost and tardiness reduction in aircraft manufacturing flow lines (Q1634065) (← links)
- Metaheuristics for the single machine weighted quadratic tardiness scheduling problem (Q1651631) (← links)
- Efficient local search limitation strategy for single machine total weighted tardiness scheduling with sequence-dependent setup times (Q1652166) (← links)
- Exact and heuristic algorithms for order acceptance and scheduling with sequence-dependent setup times (Q1652516) (← links)
- A decomposition-based two-stage optimization algorithm for single machine scheduling problems with deteriorating jobs (Q1665390) (← links)
- An improved particle swarm optimization for selective single machine scheduling with sequence dependent setup costs and downstream demands (Q1666342) (← links)
- Scheduling with time-dependent discrepancy times (Q1702735) (← links)
- How unsplittable-flow-covering helps scheduling with job-dependent cost functions (Q1751090) (← links)
- Dispatching heuristics for the single machine weighted quadratic tardiness scheduling problem (Q1761154) (← links)
- Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one (Q1761818) (← links)
- An exact approach for scheduling jobs with regular step cost functions on a single machine (Q1762077) (← links)
- The single-machine total weighted tardiness scheduling problem with position-based learning effects (Q1762088) (← links)
- A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine (Q1762139) (← links)
- A tabu search algorithm for parallel machine total tardiness problem (Q1765548) (← links)
- Single machine preemptive scheduling with fixed jobs to minimize tardiness related criteria (Q1767711) (← links)
- On the single machine total tardiness problem (Q1771373) (← links)
- Single machine scheduling to minimize total weighted tardiness (Q1772846) (← links)
- Scheduling a single machine to minimize a regular objective function under setup constraints (Q1779690) (← links)
- Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times (Q1781549) (← links)
- Parameterized complexity of machine scheduling: 15 open problems (Q1782183) (← links)
- An exact exponential branch-and-merge algorithm for the single machine total tardiness problem (Q1786599) (← links)
- A decomposition algorithm for the single machine total tardiness problem (Q1838424) (← links)
- A fully polynomial approximation scheme for the total tardiness problem (Q1839195) (← links)
- Finding the Pareto-optima for the total and maximum tardiness single machine problem (Q1850123) (← links)
