The following pages link to Hoogeveen, J. A. (Q161973):
Displayed 50 items.
- Item:Q161973 (redirect page) (← links)
- Item:Q161973 (redirect page) (← links)
- Decomposition approaches for recoverable robust optimization problems (Q322768) (← links)
- Book review of: Vincent T'kindt and Jean-Charles Billaut, Multicriteria scheduling. Theory, models and algorithms. (Q490292) (← links)
- Minimizing total weighted tardiness on a single machine with release dates and equal-length jobs (Q633558) (← links)
- Minimizing the number of late jobs in a stochastic setting using a chance constraint (Q835575) (← links)
- Lower bounds for minimizing total completion time in a two-machine flow shop (Q880570) (← links)
- Analysis of Christofides' heuristic: some paths are more difficult than cycles (Q1180833) (← links)
- Scheduling around a small common due date (Q1183621) (← links)
- A new lower bound approach for single-machine multicriteria scheduling (Q1198623) (← links)
- Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard (Q1266667) (← links)
- Minimizing total weighted completion time in a proportionate flow shop (Q1268838) (← links)
- Scheduling a batching machine (Q1268850) (← links)
- Scheduling by positional completion times: Analysis of a two-stage flow shop problem with a batching machine (Q1290647) (← links)
- Minimizing makespan in a pallet-constrained flowshop (Q1295835) (← links)
- Three, four, five, six, or the complexity of scheduling with communication delays (Q1342284) (← links)
- Complexity of scheduling multiprocessor tasks with prespecified processors allocations (Q1343144) (← links)
- Preemptive scheduling with rejection (Q1411622) (← links)
- Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing (Q1584823) (← links)
- Restarts can help in the on-line minimization of the maximum delivery time on a single machine (Q1592755) (← links)
- Some comments on sequencing with controllable processing times (Q1599819) (← links)
- A very difficult scheduling problem with communication delays (Q1604057) (← links)
- Column generation strategies and decomposition approaches for the two-stage stochastic multiple knapsack problem (Q1652300) (← links)
- Minimizing the number of late jobs when the start time of the machine is variable (Q1758276) (← links)
- The two-machine open shop problem: To fit or not to fit, that is the question (Q1811630) (← links)
- The three-machine proportionate flow shop problem with unequal machine speeds (Q1811632) (← links)
- A combinatorial property of Pallet-constrained two machine flow shop problem in minimizing makespan (Q1868959) (← links)
- Stronger Lagrangian bounds by use of slack variables: Applications to machine scheduling problems (Q1906070) (← links)
- Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time (Q1924612) (← links)
- Rescheduling for new orders on a single machine with setup times (Q1926981) (← links)
- Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard (Q2464428) (← links)
- Multicriteria scheduling (Q2566699) (← links)
- Scheduling with step-improving processing times (Q2583705) (← links)
- Synchronizing transportation of people with reduced mobility through airport terminals (Q2664455) (← links)
- (Q2753942) (← links)
- (Q2753958) (← links)
- Minimizing Total Completion Time in a Two-Machine Flowshop: Analysis of Special Cases (Q2757616) (← links)
- Parallel Machine Scheduling by Column Generation (Q2770127) (← links)
- Robust Recoverable Path Using Backup Nodes (Q2794347) (← links)
- Non-Approximability Results for Scheduling Problems with Minsum Criteria (Q2884502) (← links)
- Combining Column Generation and Lagrangean Relaxation to Solve a Single-Machine Common Due Date Problem (Q2884522) (← links)
- Lower Bounds for the Head-Body-Tail Problem on Parallel Machines: A Computational Study of the Multiprocessor Flow Shop (Q2890475) (← links)
- Performing Multicut on Walkable Environments (Q2958325) (← links)
- Recoverable Robustness by Column Generation (Q3092230) (← links)
- A Column Generation Based Destructive Lower Bound for Resource Constrained Project Scheduling Problems (Q3612431) (← links)
- Integrated Gate and Bus Assignment at Amsterdam Airport Schiphol (Q3649172) (← links)
- (Q3840371) (← links)
- Seven criteria for integer sequences being graphic (Q3978365) (← links)
- (Q4002567) (← links)
- (Q4234143) (← links)