Open Shop is a classical scheduling problem: given a set J of jobs and a setM of machines, find a minimum-makespan schedule to process each job Ji ∈ J on each machine Mq ∈ M for a given amount piq of time such that each machine processes only one job at a time and each job is processed by only one machine at a time. In Routing Open Shop, the jobs are located in the vertices of an edge-weighted ...

In this paper, four algorithms based on some single-pass heuristics are proposed to solve the flexible flow-shop group scheduling problems with more than two machine centers, which have the same number of parallel machines. Single-pass heuristics need less computation time than multiple-pass ones. The single-pass heuristics adopted in the paper includes the PT, the Palmer and the Gupta algorith...

An interesting research area is to solve scheduling problems using network flow models and algorithms. Most of the existing papers in this research area deal with scheduling problems with parallel machines (identical and / or uniform machines). This paper considers the specialized case and develops network flow models and algorithms to solve open shop and flow and job shop problems.

Ideal schedules minimize both maximum completion time and total completion time of jobs. This paper presents polynomial-time algorithms finding ideal nonpreemptive and preemptive two-machine schedules of jobs with arbitrary release dates and precedence constraints and unit-execution-time operations on identical parallel machines, in a flow shop and an open shop. Heretofore, the complexity statu...

This paper proposes a distributed manufacturing scheduling framework at the shop floor level. The shop floor is modeled as a collection of multiple workcells, each of which is modeled as a flexible manufacturing system. The framework consists of a distributed shop floor control structure, dynamic distributed scheduling algorithms, multi-agent system modeling of workcell, and service oriented in...

An NP-hard problem like Flexible Job Shop Scheduling (FJSP) tends to be more complex and requires computational effort optimize the objectives with contradictory measures. This paper aims address FJSP combined objectives, minimization of make-span, maximum workload, total workload. proposes ‘Hybrid Adaptive Firefly Algorithm’ (HAdFA), a new enhanced version classic Algorithm (FA) embedded adapt...

The multi-objective flexible job shop scheduling in a cellular manufacturing environment is challenging real-world problem. This recently introduced problem variant considers exceptional parts, intercellular moves, transportation times, sequence-dependent family setup and recirculation requiring minimization of makespan total tardiness, simultaneously. A previous study shows that the exact solv...