determination problem here can be described as so-called Weighted Job Interval Scheduling Problem (WJISP). Since this problem is … known to be NP-hard, heuristics have become a main research interest. Unfortunately, there has not been done much research …

In this paper, we propose a general model for various scheduling problems that occur in container terminal logistics …. The scheduling model consists of the assignment of jobs to resources and the temporal arrangement of the jobs subject to … real-world problems from container terminals in the port of Hamburg (Germany). We consider scheduling problems for straddle …

scheduling problems (PLSPs) that appear in the scope of short-term production planning. It is one of the first papers that deals … with dynamic capacitated multi-level lot sizing and scheduling which is of great practical importance. The PLSP model … refines well-known mixed-integer programming formulations for dynamic capacitated lot sizing and scheduling as for instance …

In this paper we address the scheduling problem that comes from an ice cream manufacturing company. This production …

heuristics do better. In priority rule-based scheduling, attempts to remedy this have been made by combining simple priority … algorithmic approaches from the open literature. Although these have been used in various settings (e.g. lotsizing and scheduling …, course scheduling), a thorough experimental investigation, comparing their performance on standard benchmark instances to …

Resource-constrained project scheduling under a net present value objective attracts growing interest. Because this is … an NP-hard problem, it is unlikely that optimum solutions can be computed for large instances. Thus, heuristics have … evaluate their heuristics on the basis of a best known lower bound, but it is unclear how good the performance really is. With …

preemptive two-agent scheduling in open shops subject to machine maintenance and eligibility constraints. Design …