The following pages link to (Q4055377):
Displaying 50 items.
- Genetic algorithms to minimize the weighted number of late jobs on a single machine. (Q1410613) (← links)
- An improved branch and bound algorithm for single machine scheduling with deadlines to minimize total weighted completion time. (Q1412717) (← links)
- A note on scheduling multiprocessor tasks with identical processing times. (Q1413834) (← links)
- Scheduling unrelated parallel machines to minimize total weighted tardiness. (Q1413838) (← links)
- Minimizing the weighted number of tardy jobs on a two-machine flow shop. (Q1413849) (← links)
- Local search for multiprocessor scheduling: how many moves does it take to a local optimum? (Q1413905) (← links)
- On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times. (Q1413926) (← links)
- Open shop scheduling problems with late work criteria. (Q1421458) (← links)
- A note on the maximum number of on-time jobs on parallel identical machines. (Q1422366) (← links)
- A note on the SPT heuristic for solving scheduling problems with generalized due dates (Q1433162) (← links)
- Parallel machine scheduling with a common server (Q1566574) (← links)
- Scheduling equal-length jobs on identical parallel machines (Q1570817) (← links)
- Nonpreemptive flowshop scheduling with machine dominance (Q1604067) (← links)
- A note on the single machine serial batching scheduling problem to minimize maximum lateness with precedence constraints (Q1612004) (← links)
- Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources (Q1753460) (← links)
- Dispatching heuristics for the single machine weighted quadratic tardiness scheduling problem (Q1761154) (← links)
- Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates (Q1761994) (← links)
- Scheduling unrelated parallel machines with optional machines and jobs selection (Q1762164) (← links)
- A review of exact solution methods for the non-preemptive multiprocessor flowshop problem (Q1767678) (← links)
- Single machine scheduling to minimize total weighted tardiness (Q1772846) (← links)
- An exact approach to early/tardy scheduling with release dates (Q1781563) (← links)
- Deterministic job-shop scheduling: Past, present and future (Q1807948) (← links)
- Analysis of the twisting department at superior cable corporation: A case study (Q1809862) (← links)
- Preemptive scheduling on identical parallel machines subject to deadlines. (Q1810503) (← links)
- A class of on-line scheduling algorithms to minimize total completion time (Q1811633) (← links)
- Using short-term memory to minimize the weighted number of late jobs on a single machine. (Q1812007) (← links)
- Common due date assignment and scheduling with ready times (Q1867095) (← links)
- Makespan estimation in batch process industries: A comparison between regression analysis and neural networks (Q1869422) (← links)
- A branch and bound to minimize the number of late jobs on a single machine with release time constraints (Q1869685) (← links)
- A note on the single machine serial batching scheduling problem to minimize maximum lateness with identical processing times (Q1876151) (← links)
- A heuristic approach for minimizing weighted tardiness and overtime costs in single resource scheduling (Q1885984) (← links)
- Improved heuristics for the early/tardy scheduling problem with no idle time (Q1886859) (← links)
- Makespan minimization for two parallel machines with an availability constraint (Q1887910) (← links)
- A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recircu\-lation (Q1887965) (← links)
- Scheduling shops to minimize the weighted number of late jobs (Q1890952) (← links)
- Lot sizing in a no-wait flow shop (Q1904756) (← links)
- The Pareto-optimal set of the NP-hard problem of minimization of the maximum lateness for a single machine (Q1951910) (← links)
- Complexity of mixed shop scheduling problems: A survey (Q1969835) (← links)
- Minimizing functions of infeasibilities in a two-machine flow shop (Q1969868) (← links)
- Decorous combinatorial lower bounds for row layout problems (Q2189888) (← links)
- Single machine scheduling to minimize maximum lateness subject to release dates and precedence constraints (Q2270437) (← links)
- The two-machine flow shop problem with arbitrary precedence relations (Q2366083) (← links)
- \(K\)-PPM: a new exact method to solve multi-objective combinatorial optimization problems (Q2379522) (← links)
- A survey of scheduling with controllable processing times (Q2381529) (← links)
- A multi-objective optimization for preemptive identical parallel machines scheduling problem (Q2403115) (← links)
- Scatter search for minimizing weighted tardiness in a single machine scheduling with setups (Q2403268) (← links)
- Single machine unbounded parallel-batch scheduling with forbidden intervals (Q2426551) (← links)
- Pareto optima for total weighted completion time and maximum lateness on a single machine (Q2457015) (← links)
- Multi-family scheduling in a two-machine reentrant flow shop with setups (Q2467261) (← links)
- Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups (Q2468493) (← links)
