This paper considers two problem classes that are important to researchers as well as practitioners, namely packing and project scheduling problems. First, the two problem categories are described. This includes a classification of packing problems as well as of project scheduling concepts....

Scheduling problems are generally NP-hard combinatorial problems, and a lot of research has been done to solve these problems heuristically. However, most of the previous approaches are problem-specific and research into the development of a general scheduling algorithm is still in its infancy....

Motivated by the advantage of just-in-time philosophy, zero-inventory is common in many industries, especially the ones that need fast response with a short lifespan. Accordingly, this paper focuses on coordinated production scheduling and distribution operation problems considering DeJong’s...