A large neighborhood search approach for the paint shop scheduling problem

Multi Agents approach for Job Shop Scheduling Problem using Genetic Algorithm and Variable Neighborhood Search method

The job shop scheduling is an important and complex problem for a manufacturing system. It is well known and popular problem having (Non-Polynomial) NP-hard characteristic to find the optimal or near optimal solution (schedules) quickly. In job shop scheduling a set of “N” number of jobs are processed through an “M” number of given set of machines. It must be processed in the prescribed order b...

Flow shop Scheduling Problem with Maintenance Coordination: a New Approach

This study investigates the coordination of production scheduling and maintenance planning in theflow shop scheduling environment. The problem is considered in a bi-objective form, minimizing themakespan as the production scheduling criterion and minimizing the system unavailability as themaintenance planning criterion. The time interval between consecutive maintenance activities as well as the...

The Binary Paint Shop Problem

We consider the binary paint shop problem (PPW(2,1)). We describe an approach to solve PPW(2,1). This approach is based on constructing a logical model for PPW(2,1). Mathematics Subject Classification: 68T20

A tabu search algorithm for the open shop scheduling problem

Randomized Large Neighborhood Search for Cumulative Scheduling

This paper presents a Large Neighborhood Search (LNS) approach based on constraint programming to solve cumulative scheduling problems. It extends earlier work on constraint-based randomized LNS for disjunctive scheduling as reported in (Nuijten & Le Pape 1998). A breakthrough development in generalizing that approach toward cumulative scheduling lies in the presented way of calculating a parti...