An Integrated Model for Job-Shop Planning and Scheduling

We consider an integrated job-shop planning and scheduling model. To solve the problem we use a (multi-pass) decomposition approach which alternates between solving a planning problem with a fixed sequence of products on the machines, and a job-shop scheduling problem for a fixed choice of the production plan. The generated production plans are feasible i.e., there exists at least one feasible schedule to realize that plan. Quality of the solution is investigated and numerical results are presented.