For the basic problem of non-preemptively scheduling n independent jobs on m identical parallel machines so that the …-known longest-first heuristics - the LPT- (longest processing time) and the RLPT-heuristic (restricted LPT). We provide insights … into the solution structure of these two sequencing heuristics and prove that the minimum completion time of the LPT …

, we propose a new approach for scheduling JIT part supply from a central storage center. Usually, materials are stored in … is the first time a statistical analysis is being made as to whether widespread Level Scheduling policies, which are well …

Scheduling landings of aircrafts is an essential problem which is continuously solved as part of the daily operations …

considered. Including this aspect leads to a joint balancing and scheduling problem, which we call SUALBSP (setup assembly line … balancing and scheduling problem). In this paper, we modify the problem by modeling setups more realistically, give a new, more … existing and new data sets indicate that the new procedures outperform formerly proposed heuristics and are able to solve …

merged to full truck loads in order to realize economies in transportation. In this context, the truck scheduling problem … and on-time deliveries. Due to its high real-world significance, several truck scheduling procedures have been introduced …, the paper on hand introduces a classification of deterministic truck scheduling. With the help of this classification …

trucks, so that delays and inventories are kept as low as possible. We consider an operational truck scheduling problem … to minimize total lost profit. The paper at hand formalizes the resulting truck scheduling problem. We settle its … computational complexity and develop heuristics in order to tackle the problem. We show the efficiency of these heuristics by means …