Brucker Peter

Peter Brucker

Information about the author Peter Brucker will soon be added to the site.
Found 35 papers in total
A note on ‘event‐based MILP models for resource‐constrained project scheduling problems’
A note on ‘event‐based MILP models for resource‐constrained project scheduling problems’
2013
Recently, new mixed integer linear programming formulations for the...
A polynomial‐time algorithm for a flow‐shop batching problem with equal‐length operations
A polynomial‐time algorithm for a flow‐shop batching problem with equal‐length operations
2011
A flow‐shop batching problem with consistent batches is considered in which the...
Inverse scheduling: two‐machine flow‐shop problem
Inverse scheduling: two‐machine flow‐shop problem
2011
We study an inverse counterpart of the two‐machine flow‐shop scheduling...
A shift sequence based approach for nurse scheduling and a new benchmark dataset
A shift sequence based approach for nurse scheduling and a new benchmark dataset
2010
This paper investigates an adaptive constructive method for solving nurse rostering...
Inverse scheduling with maximum lateness objective
Inverse scheduling with maximum lateness objective
2009
We study a range of counterparts of the single-machine scheduling problem with the...
Cyclic job shop scheduling problems with blocking
Cyclic job shop scheduling problems with blocking
2008
A tabu search algorithm for a cyclic job shop problem with blocking is presented....
The complexity of mean flow time scheduling problems with release times
The complexity of mean flow time scheduling problems with release times
2007
We study the problem of preemptive scheduling of n jobs with given release times on m...
Tabu search algorithms for cyclic machine scheduling problems
Tabu search algorithms for cyclic machine scheduling problems
2005
Tabu search algorithms are developed for solving a large class of cyclic machine...
Scheduling equal processing time jobs to minimize the weighted number of late jobs
Scheduling equal processing time jobs to minimize the weighted number of late jobs
2006
We prove that the problem {P|p i =p (all i), pmtn | ∑ i w i U i } is...
Complexity results for flow-shop problems with a single server
Complexity results for flow-shop problems with a single server
2005
Flow-shop problems with a single server are generalizations of classical flow-shop...
Complexity results for flow-shop and open-shop scheduling problems with transportation delays
Complexity results for flow-shop and open-shop scheduling problems with transportation delays
2004
We consider shop problems with transportation delays where not only the jobs on the...
Lower bounds for resource-constrained project scheduling problems
Lower bounds for resource-constrained project scheduling problems
2003
A destructive lower bound for the multi-mode resource-constrained project scheduling...
Complexity results for parallel machine problems with a single server
Complexity results for parallel machine problems with a single server
2002
Parallel machine problems with a single server are generalizations of classical...
How useful are preemptive schedules?
How useful are preemptive schedules?
2003
Machine scheduling admits two options to process jobs. In a preemptive mode processing...
Lower bounds for scheduling a single robot in a job-shop environment
Lower bounds for scheduling a single robot in a job-shop environment
2002
We consider a single-machine scheduling problem which arises as a subproblem in a...
Solving open benchmark instances for the job-shop problem by parallel head–tail adjustments
Solving open benchmark instances for the job-shop problem by parallel head–tail adjustments
2001
A fast and efficient head–tail adjustment algorithm is presented for the...
A linear programming and constraint propagation-based lower bound for the resource-constrained project scheduling problem
A linear programming and constraint propagation-based lower bound for the resource-constrained project scheduling problem
2000
A new destructive lower bound for the resource-constrained project scheduling problem...
Solving a chemical batch scheduling problem by local search
Solving a chemical batch scheduling problem by local search
2000
In this paper the following chemical batch scheduling problem is considered: a set of...
A new tabu search procedure for an audit-scheduling problem
A new tabu search procedure for an audit-scheduling problem
1999
We consider the following version of the auditing problem. A set of jobs must be...
A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags
A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags
1999
Positive and negative time-lags are general timing restrictions between the starting...
Scheduling identical jobs with chain precedence constraints in two uniform machines
Scheduling identical jobs with chain precedence constraints in two uniform machines
1999
The problem of scheduling identical jobs with chain precedence constraints on two...
Resource-constrained project scheduling: Notation, classification, models, and methods
Resource-constrained project scheduling: Notation, classification, models, and methods
1999
Project scheduling is concerned with single-item or small batch production where...
Scheduling a batching machine
Scheduling a batching machine
1998
We address the problem of scheduling n jobs on a batching machine to minimize regular...
Preemptive job-shop scheduling problems with a fixed number of jobs
Preemptive job-shop scheduling problems with a fixed number of jobs
1999
It is shown that the two machine preemptive job-shop problem with mean flow-time or...
Papers per page: