The following pages link to (Q4055377):
Displaying 50 items.
- Minimizing the number of late jobs for the permutation flowshop problem with secondary resources (Q941545) (← links)
- A note on the total completion time problem in a permutation flowshop with a learning effect (Q948678) (← links)
- A scheduling problem with job values given as a power function of their completion times (Q954933) (← links)
- Single-machine scheduling under the job rejection constraint (Q964407) (← links)
- Integrated production and distribution scheduling with committed delivery dates (Q969521) (← links)
- A parallel multiple reference point approach for multi-objective optimization (Q976459) (← links)
- Iterated greedy local search methods for unrelated parallel machine scheduling (Q992577) (← links)
- A population-based variable neighborhood search for the single machine total weighted tardiness problem (Q1001005) (← links)
- Minimizing the total completion time in permutation flow shop with machine-dependent job deterioration rates (Q1001006) (← links)
- Interval-indexed formulation based heuristics for single machine total weighted tardiness problem (Q1001009) (← links)
- Minimizing the total weighted completion time on a single machine scheduling with release dates and a learning effect (Q1004418) (← links)
- Single machine parallel-batch scheduling with deteriorating jobs (Q1006057) (← links)
- The single-machine total tardiness scheduling problem: review and extensions (Q1038369) (← links)
- Models for concurrent product and process design (Q1046061) (← links)
- Flexible solutions in disjunctive scheduling: general formulation and study of the flow-shop case (Q1046704) (← links)
- An asymptotically exact polynomial algorithm for equipartition problems (Q1076607) (← links)
- A compact labelling scheme for series-parallel graphs (Q1079115) (← links)
- Average and worst-case analysis of heuristics for the maximum tardiness problem (Q1080771) (← links)
- A block approach for single-machine scheduling with release dates and due dates (Q1083026) (← links)
- Single machine scheduling to minimize weighted earliness subject to no tardy jobs (Q1105480) (← links)
- A new integer programming formulation for the permutation flowshop problem (Q1121163) (← links)
- An algorithm for single machine sequencing with release dates to minimize maximum cost (Q1121165) (← links)
- A branch and bound algorithm to minimize the number of late jobs in a permutation flow-shop (Q1121779) (← links)
- Multiple and bicriteria scheduling: A literature survey (Q1130028) (← links)
- A procedure for the one-machine sequencing problem with dependent jobs (Q1130073) (← links)
- An adaptive branching rule for the permutation flow-shop problem (Q1141078) (← links)
- Complexity results for scheduling chains on a single machine (Q1142687) (← links)
- An algorithm for single machine sequencing with deadlines to minimize total weighted completion time (Q1170111) (← links)
- On the complexity of generalized due date scheduling problems (Q1175769) (← links)
- Single machine scheduling problem with a common deadline and resource dependent release dates (Q1178528) (← links)
- The complexity of shop-scheduling problems with two or three jobs (Q1178530) (← links)
- Scheduling jobs on a single machine with release dates, delivery times and controllable processing times: Worst-case analysis (Q1186948) (← links)
- Scheduling with release dates on a single machine to minimize total weighted completion time (Q1193720) (← links)
- A guaranteed accuracy shifting bottleneck algorithm for the two-machine flowshop total tardiness problem (Q1265840) (← links)
- Single machine earliness and tardiness scheduling (Q1278531) (← links)
- Complexity of single machine, multi-criteria scheduling problems (Q1309989) (← links)
- An approximation algorithm for a single-machine scheduling problem with release times and delivery times (Q1314328) (← links)
- A note on generalizing the maximum lateness criterion for scheduling (Q1315993) (← links)
- An optimal scheduling algorithm for preemptable real-time tasks (Q1321836) (← links)
- A branch and bound algorithm for the job-shop scheduling problem (Q1327223) (← links)
- An ordered independence system and its applications to scheduling problems (Q1330565) (← links)
- Preemptive scheduling with release dates, delivery times and sequence independent setup times (Q1331546) (← links)
- Adjustment of heads and tails for the job-shop problem (Q1341994) (← links)
- Development of a heuristic project scheduler under resource constraints (Q1342049) (← links)
- Complexity of scheduling multiprocessor tasks with prespecified processors allocations (Q1343144) (← links)
- Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications (Q1348546) (← links)
- A polynomial approximation scheme for problem \(F2/r_ j/C_{\text{max}}\) (Q1376266) (← links)
- Heuristic procedures for minimizing makespan and the number of required pallets (Q1390237) (← 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)
