This paper addresses the combined JIT scheduling and tool replacement problem on a machining centre. The objective is to determine job sequence, tool spare requirement and corresponding replacement intervals so that the total expected processing cost is minimized. Due to the combinatorial nature of the problem, a tabu search approach is proposed to find good and quick solutions. An example prob...

We prove Fraenkel’s conjecture for the special case of symmetric words, and show that this proof implies the conjecture of Brauner and Crama [Facts and questions about the maximum deviation just-in-time scheduling problem, Discrete Appl. Math. 134 (2004) 25–50] concerning instances of the just-in-time sequencing problem with maximum deviation B∗< 1 2 . © 2007 Elsevier B.V. All rights reserved.

this paper considers a two-stage assembly flow shop problem (tafsp) where m machines are in the first stage and an assembly machine is in the second stage. the objective is to minimize a weighted sum of earliness and tardiness time for n available jobs. jit seeks to identify and eliminate waste components including over production, waiting time, transportation, inventory, movement and defective...

We study the approximability of minimum total weighted tardiness with a modified objective which includes an additive constant. This ensures the existence of a positive lower bound for the minimum value. Moreover the new objective has a natural interpretation in Just-In-Time production systems.

Flow shop scheduling problem has a wide application in the manufacturing and has attracted much attention in academic fields. From other point, on time delivery of products and services is a major necessity of companies’ todays; early and tardy delivery times will result additional cost such as holding or penalty costs.  In this paper, just-in-time (JIT) flow shop scheduling problem with preemp...

Synchronous Data Flow (SDF) is a popular model for analyzing workflows. It is well-known that self-timed scheduling, starting a task when all its prerequisites are satisfied, is throughput-optimal for SDF graphs. Just-in-time scheduling in the presence of deadlines has so far received little attention in the literature. We show that a feasible just-in-time schedule exists if and only if a feasi...

With the introduction of the On Demand Operating Environment (ODOE), traditional capacity planning methodologies are being replaced by just in time resource allocation. This paper examines the application of supply chain mechanisms to dynamically coordinate the available compute capacity/resources with the service capacity/resources requirements. After reaching the ideal condition with a comple...

This research presents a variation to the permutation ̄ow shop problem where Just In Time (JIT) production requirements are taken into account. The model developed in this research employs dual objectives. In addition to the traditional objective of minimizing the production makespan, minimization of Miltenburg’s material usage rate is also incorporated. In this model, multiple units of any pro...