Showing papers by "Peter Brucker published in 2012"
TL;DR: A new integer programming formulation is presented and it is shown that it outperforms an existing model from the literature in the problem of minimising the cycle time (maximising the throughput) in a job-shop environment.
28 citations
TL;DR: A tree search method is developed to construct feasible solutions and combined it with a bounding procedure for minimizing the cycle time in the cyclic job-shop problem where the machines have no buffers.
24 citations
01 Jan 2012
TL;DR: This chapter presents different solution methods for the RCPSP with the makespan objective and some of its generalizations (like the multi-mode RCPSp).
Abstract: As shown in Section 2.1, even special cases of the RCPSP are NP-hard, i.e. with high probability they cannot be exactly solved in polynomial time. Thus, for larger instances in practice approximation algorithms have to be applied. In this chapter we present different solution methods for the RCPSP with the makespan objective and some of its generalizations (like the multi-mode RCPSP).
23 citations
01 Jan 2012
TL;DR: This chapter is devoted to another important basic scheduling problem: the jobshop problem, a special case of the RCPSP where only disjunctive resources (machines) and special precedence constraints in form of chains are given.
Abstract: This chapter is devoted to another important basic scheduling problem: the jobshop problem. This problem is a special case of the RCPSP where only disjunctive resources (machines) and special precedence constraints in form of chains are given. After giving a precise formulation of the job-shop problem in Section 4.1, solution algorithms are discussed. While Section 4.2 deals with heuristic methods, foundations for exact branch-and-bound algorithms are presented in Section 4.3. Afterwards, generalizations and applications of the job-shop problem are considered. In Section 4.4 the concepts of time-lags and blocking are introduced. Then, we consider job-shop problems with flexible machines in Section 4.5, job-shop problems with transport robots in Section 4.6 and job-shop problems with limited buffers in Section 4.7.
1 citations
01 Jan 2012
TL;DR: This chapter discusses some basic concepts and solution methods for combinatorial optimization problems.
Abstract: this chapter we discuss some basic concepts and solution methods for combinatorial optimization problems. In a combinatorial (discrete) optimization problem we are given a finite set S and an objective function
1 citations