The following pages link to Steef L. van de Velde (Q1268849):
Displayed 40 items.
- (Q161974) (redirect page) (← links)
- Tactical fixed job scheduling with spread-time constraints (Q337014) (← links)
- Are stacker crane problems easy? A statistical study (Q340228) (← links)
- Approximation algorithms for the parallel flow shop problem (Q421785) (← links)
- A simpler and faster algorithm for optimal total-work-content-power due data determination (Q583099) (← links)
- Polynomial-time approximation schemes for scheduling problems with time lags (Q600835) (← links)
- On-line two-machine job shop scheduling with time lags (Q763542) (← links)
- Lower bounds for minimizing total completion time in a two-machine flow shop (Q880570) (← links)
- Two-machine interval shop scheduling with time lags (Q892834) (← links)
- Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation (Q922280) (← links)
- Scheduling around a small common due date (Q1183621) (← links)
- A new lower bound approach for single-machine multicriteria scheduling (Q1198623) (← 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)
- Complexity of scheduling multiprocessor tasks with prespecified processors allocations (Q1343144) (← links)
- Multi-product lot-sizing with a transportation capacity reservation contract (Q1776959) (← links)
- Positioning automated guided vehicles in a loop layout (Q1841157) (← links)
- Stronger Lagrangian bounds by use of slack variables: Applications to machine scheduling problems (Q1906070) (← links)
- Dual decomposition of a single-machine scheduling problem (Q1906279) (← links)
- Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time (Q1924612) (← links)
- Dynamic programming algorithms and Lagrangian lower bounds for a discrete lot streaming problem in a two-machine flow shop (Q2044553) (← links)
- Roll cutting in the curtain industry, or: a well-solvable allocation problem (Q2643970) (← links)
- On-line two-machine open shop scheduling with time lags (Q2654315) (← links)
- Parallel Machine Scheduling by Column Generation (Q2770127) (← links)
- An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem (Q2884524) (← links)
- Duality-Based Algorithms for Scheduling Unrelated Parallel Machines (Q4202586) (← links)
- (Q4234143) (← links)
- Scheduling deteriorating jobs to minimize makespan (Q4248925) (← links)
- New Lower and Upper Bounds for Scheduling Around a Small Common Due Date (Q4287604) (← links)
- (Q4343706) (← links)
- Earliness-Tardiness Scheduling Around Almost Equal Due Dates (Q4367046) (← links)
- A Branch-and-Bound Algorithm for Single-Machine Earliness–Tardiness Scheduling with Idle Time (Q4367055) (← links)
- Minimizing Makespan In Flowshops With Pallet Requirements: Computational Complexity (Q4380542) (← links)
- Minimizing Makespan in a Class of Reentrant Shops (Q4393117) (← links)
- (Q4398369) (← links)
- Formulating a scheduling problem with almost identical jobs by using positional completion times (Q5101423) (← links)
- Algorithms – ESA 2005 (Q5475840) (← links)
- Applying Column Generation to Machine Scheduling (Q5493636) (← links)
- Scheduling with target start times (Q5925938) (← links)