Hoogeveen Han

Han Hoogeveen

Information about the author Han Hoogeveen will soon be added to the site.
Found 19 papers in total
Combining Column Generation and Lagrangean Relaxation to Solve a Single-Machine Common Due Date Problem
Combining Column Generation and Lagrangean Relaxation to Solve a Single-Machine Common Due Date Problem
2002
Column generation has proved to be an effective technique for solving the linear...
Minimizing the number of late jobs in a stochastic setting using a chance constraint
Minimizing the number of late jobs in a stochastic setting using a chance constraint
2008
We consider the single-machine scheduling problem of minimizing the number of late...
Lower bounds for minimizing total completion time in a two-machine flow shop
Lower bounds for minimizing total completion time in a two-machine flow shop
2006
For the NP-hard problem of scheduling n jobs in a two-machine flow shop so as to...
Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard
Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard
2004
One of the first problems to be studied in scheduling theory was the problem of...
Lower bounds for the head–body–tail problem on parallel machines: A computational study of the multiprocessor flow shop
Lower bounds for the head–body–tail problem on parallel machines: A computational study of the multiprocessor flow shop
2005
The multiprocessor flow-shop is the generalization of the flow-shop in which each...
Multicriteria scheduling
Multicriteria scheduling
2005
In this paper we give a survey of the most important results on multicriteria...
Scheduling with step-improving processing times
Scheduling with step-improving processing times
2006
We consider the scheduling problem of minimizing the makespan on a single machine with...
A combinatorial property of pallet-constrained two machine flow shop problem in minimizing makespan
A combinatorial property of pallet-constrained two machine flow shop problem in minimizing makespan
2002
We consider the problem of scheduling n jobs in a pallet-constrained flow shop so as...
The two-machine open shop problem: To fit or not to fit, that is the question
The two-machine open shop problem: To fit or not to fit, that is the question
2003
We consider the open shop scheduling problem with two machines. Each job consists of...
The three-machine proportionate flow shop problem with unequal machine speeds
The three-machine proportionate flow shop problem with unequal machine speeds
2003
In flow shop scheduling it is usually assumed that the processing times of the...
Non-approximability results for scheduling problems with minsum criteria
Non-approximability results for scheduling problems with minsum criteria
2001
We provide several non-approximability results for deterministic scheduling problems...
Combining column generation and Lagrangean relaxation to solve a single-machine common due date problem
Combining column generation and Lagrangean relaxation to solve a single-machine common due date problem
2002
Column generation has proved to be an effective technique for solving the linear...
Non-approximability results for scheduling problems with minsum criteria
Non-approximability results for scheduling problems with minsum criteria
2001
We provide several non-approximability results for deterministic scheduling problems...
On-line scheduling on a single machine: Maximizing the number of early jobs
On-line scheduling on a single machine: Maximizing the number of early jobs
2000
This note deals with the scheduling problem of maximizing the number of early jobs on...
Restarts can help in the on-line minimization of the maximum delivery time on a single machine
Restarts can help in the on-line minimization of the maximum delivery time on a single machine
2000
We consider a single-machine on-line scheduling problem where jobs arrive over time. A...
Minimizing makespan in a pallet-constrained flowshop
Minimizing makespan in a pallet-constrained flowshop
1999
We consider the problem of scheduling n jobs in a pallet-constrained flowshop so as to...
Scheduling a batching machine
Scheduling a batching machine
1998
We address the problem of scheduling n jobs on a batching machine to minimize regular...
Minimizing total weighted completion time in a proportionate flow shop
Minimizing total weighted completion time in a proportionate flow shop
1998
We study the special case of the m machine flow shop problem in which the processing...
Scheduling by positional completion times: Analysis of a two-stage flow shop problem with a batching machine
Scheduling by positional completion times: Analysis of a two-stage flow shop problem with a batching machine
1998
We consider a scheduling problem introduced by Ahmadi et at ., batching and scheduling...
Papers per page: