Pages that link to "Item:Q5568940"
From MaRDI portal
The following pages link to One-Machine Sequencing to Minimize Certain Functions of Job Tardiness (Q5568940):
Displayed 50 items.
- Minimising total tardiness for a single machine scheduling problem with family setups and resource constraints (Q320637) (← links)
- Rescheduling on identical parallel machines with machine disruptions to minimize total completion time (Q322965) (← 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)
- An order scheduling problem with position-based learning effect (Q342484) (← links)
- Dominance rules in combinatorial optimization problems (Q421551) (← 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)
- A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates (Q596267) (← 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 mapping-based universal kriging model for order-of-addition experiments in drug combination studies (Q830482) (← links)
- A branch, bound, and remember algorithm for the \(1|r _{i }|\sum t _{i }\) scheduling problem (Q842556) (← links)
- Some remarks on the decomposition properties of the single machine total tardiness problem (Q856256) (← links)
- Order scheduling in an environment with dedicated resources in parallel (Q880508) (← links)
- An \(O( n^2)\) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness (Q880552) (← 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)
- A population-based variable neighborhood search for the single machine total weighted tardiness problem (Q1001005) (← links)
- Interval-indexed formulation based heuristics for single machine total weighted tardiness problem (Q1001009) (← links)
- Scheduling jobs with agreeable processing times and due dates on a single batch processing machine (Q1022597) (← links)
- The single-machine total tardiness scheduling problem: review and extensions (Q1038369) (← links)
- Dynamic programming and decomposition approaches for the single machine total tardiness problem (Q1092805) (← links)
- The two-machine flowshop scheduling problem with total tardiness (Q1115798) (← links)
- An efficient job scheduling algorithm for mixed turnaround and deadline applications (Q1140986) (← links)
- Hybrid algorithm for sequencing with bicriteria (Q1162274) (← links)
- One machine scheduling to minimize expected mean tardiness. I (Q1184467) (← links)
- Some new efficient methods to solve the \(n/1/r_ i/\sum{}T_ i\) scheduling problem (Q1197646) (← links)
- Four solution techniques for a general one machine scheduling problem. A comparative study (Q1247365) (← links)
- A survey of algorithms for the single machine total weighted tardiness scheduling problem (Q1262207) (← links)
- A simulated annealing approach for the one-machine mean tardiness scheduling problem (Q1268192) (← links)
- Single-machine scheduling with time windows and earliness/tardiness penalties (Q1278201) (← links)
- Evaluation of leading heuristics for the single machine tardiness problem (Q1278530) (← links)
- A heuristic for the single machine tardiness problem (Q1310015) (← links)
- One machine scheduling to minimize expected mean tardiness. II (Q1332812) (← links)
- The stochastic single machine scheduling problem with earliness and tardiness costs (Q1333461) (← links)
- Decomposition of the single machine total tardiness problem (Q1362989) (← links)
- Approximate algorithms for the \(P\parallel C_{\max}\) problem (Q1367883) (← links)
- Generalized pairwise interchanges and machine scheduling (Q1388824) (← links)
- A new lower bounding scheme for the total weighted tardiness problem. (Q1406617) (← links)
- Scheduling unrelated parallel machines to minimize total weighted tardiness. (Q1413838) (← links)
- Parallel machine scheduling with a common server (Q1566574) (← links)
- Solution of the single machine total tardiness problem (Q1592283) (← 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)
- Designing and constructing networks under uncertainty in the construction stage: definition and exact algorithmic approach (Q1652235) (← links)
- Lot-order assignment applying priority rules for the single-machine total tardiness scheduling with nonnegative time-dependent processing times (Q1665667) (← links)
- Scheduling on parallel identical machines with late work criterion: offline and online cases (Q1702733) (← links)
- Exact methods for order acceptance and scheduling on unrelated parallel machines (Q1725610) (← links)
- Minimizing the weighted sum of squared tardiness on a single machine (Q1762060) (← links)