Job-shop manufacturing environment requires planning of schedules for the systems of low-volume having numerous variations. For a job-shop scheduling, ‘k’ number of operations and ‘n’ number of jobs on ‘m’ number of machines processed through an assured objective function to be minimized (makespan). This paper presents a capable genetic algorithm for the job-shop scheduling problems among opera...

This paper proposes an Improved Multi-phase Particle Swarm Optimization (IMPPSO) to solve a Dynamic Job Shop Scheduling Problem (DJSSP) known as non-deterministic polynomial-time hard (NP-hard) problem. A cellular neighbor network, velocity reinitialization strategy, randomly select sub-dimension and constraint handling function are introduced in the IMPPSO. The IMPPSO is used Kundakcı Kulak pr...

This paper presents a comparison study of the computational complexity of the general job shop protocol and the ow line protocol in a exible manufacturing system. It is shown that 2 a certain representative problem of nding resource invariants is NP-complete in the case of the job shop, while in the ow line case it admits a closed-form solution. The importance of correctly selecting part ow and...

Scheduling is a scientific domain concerning the allocation of limited tasks over time. The goal of scheduling is to maximize (or minimize) different criteria of a facility as makespan, occupation rate of a machine, total tardiness ... In this area, scientific community usually group the problem with, on one hand the system studied, defining the number of machines (one machine, parallel machine...

In this paper we present a linear time approximation scheme for the job shop scheduling problem with fixed number of machines and fixed number of operations per job. This improves on the previously best 2 + ǫ, ǫ > 0, approximation algorithm for the problem by Shmoys, Stein, and Wein. Our approximation scheme is very general and it can be extended to the case of job shop scheduling problems with...

Abstract—In most classical scheduling models, a job is assumed to deliver to a customer at the instant of a job processing completion. In numerous practical situations, however, multiple delivery dates exist, where the time interval between any two consecutive delivery dates is constant. This type of fixed delivery strategy results in substantial cost savings for transportation and handling. Th...

63 An Efficient Memetic Algorithm for Dynamic Flexible Job Shop Scheduling with Random Job Arrivals Liping Zhang, The State Key Laboratory of Digital Manufacturing Equipment and Technology, Huazhong University of Science & Technology, Wuhan, China Xinyu Li, The State Key Laboratory of Digital Manufacturing Equipment and Technology, Huazhong University of Science & Technology, Wuhan, China Long ...

This paper presents and evaluates an order release decision rule in a job-shop, based on the input-output control concept. The order release mechanism is part of a global decision-making scheme that includes four main decisions: accept/reject orders, define the order’s due date, release the accepted jobs and dispatch it on the shop floor. This paper also presents an evaluation of two acceptance...

The n×m minimum-makespan general job-shop scheduling problem, hereafter referred to as the JSSP, can be described by a set of n jobs {Ji}1≤j≤n which is to be processed on a set of m machines {Mr}1≤r≤m. Each job has a technological sequence of machines to be processed. The processing of job Jj on machine Mr is called the operation Ojr. Operation Ojr requires the exclusive use of Mr for an uninte...

Coordination plays crucial role in supply chain scheduling. In this paper, we extend the existing body of literature on supply chain scheduling by representing the robust schedule coordination approach. A hybrid discrete/continuous flow shop supply chain with job shop processes at each supplier stage is studied with dynamic optimal control models. We consider operations, channel, resource and f...