Abstract: We develop a constant-inventory tactical planning model for a generic manufacturing system, such as a job shop. The model is based on a discrete-time, continuous flow model developed by the first author. In the model, we assume that we can regulate the release of work to the shop to maintain the constant-inventory constraint. We characterize the conditions for which the shop productio...

Choi, B.-C., Yoon, S.-H., Chung, S.-J., 2007. Minimizing maximum completion time in a proportionate flow shop with one machine of different speed. European Journal of Operational Research 176, 964–974 consider the proportionate flow shop with a slow bottleneck machine and propose the SLDR heuristic for it. Choi et al. (2007) derive a data-dependent worst-case ratio bound for the SLDR heuristic ...

Although the deterministic flow shop model is one of the most widely studied problems in scheduling theory, its stochastic analog has remained a challenge. No computationally efficient optimization procedure exists even for the general two-machine version. In this paper, we describe three heuristic procedures for the stochastic two-machine flow shop problem and report on computational experimen...

This paper proposes a heuristic method based on ant colony optimization to determine the suboptimal allocation of dynamic multi-attribute dispatching rules to maximize job shop system performance (four measures were analyzed: mean flow time, max flow time, mean tardiness, and max tardiness). In order to assure high adequacy of the job shop system representation, modeling is carried out using di...

Mass customization manufacturing (MCM) has been gaining recognition as an industrial revolution in the 21st century. This paper presents innovative approaches in realizing and exercising MCM in theoretical and practical applications. Strategies of generalized production line platform and modularization are explored to support dynamic reconfigurations of MCM. NIST’s XML-based Shop Data informati...

In this paper, we consider the problem of scheduling n jobs on m machines in an open shop environment so that the sum of completion times or mean flow time becomes minimal. For this strongly NP-hard problem, we develop and discuss different constructive heuristic algorithms. Extensive computational results are presented for problems with up to 50 jobs and 50 machines, respectively. The quality ...

The aim of this paper is to introduce the concept of disjoint job blocks in n-jobs, three machines flow shop scheduling problem to minimize the total elapsed time and rental cost of the machines under a specified rental policy in which the processing time associated with probabilities including transportation time. A heuristic approach for flow shop with a computational algorithm to find optima...

This research paper focuses on the simulation-based comparative study of several new dispatching rules with the existing ones for the minimisation of flow time based performance measures such as mean flow time, maximum flow time and variance of flow time. The authors have proposed five new flow time based dispatching rules. The best of existing rules such as PT+PW, AT, AT-RPT, FDD and the stand...

Radio Frequency Identification (RFID) technologies provide automatic and accurate object data capturing capability and enable real-time object visibility and traceability. Potential benefits have been widely reported for improving manufacturing shop-floor management. However, reports on how such potentials come true in real-life shopfloor daily operations are very limited. As a result, skeptics...

The partially-concurrent open shop scheduling problem is presented. The standard open shop scheduling problem is generalized by allowing some operations to be processed concurrently. This generalization is directly motivated from a real-life timetabling project of assigning technicians to airplanes in an airplane garage. A schedule for the partially-concurrent problem is represented by a digrap...