appropriate scheduling and sequencing of tasks on machines is one of the basic and significant problems that a shop or a factory manager encounters; this is why in recent decades extensive studies have been done on scheduling issues. one type of scheduling problems is just-in-time (jit) scheduling and in this area, motivated by jit manufacturing, this study investigates a mathematical model for...

We brieey describe a Just-In-Time (JIT) implementation where cyclic schedules play a critical role. Central to the implementation is a clear understanding of the interactions between scheduling, due date quotation, capacity allocation, variability in production and demand, inventory management and customer service. Furthermore, a novelty of this implementation is that we used the new technology...

In this paper, we propose and derive a slotted-time model for analyzing the burst blocking probability in Optical Burst Switched (OBS) networks. We evaluated the immediate and delayed signaling reservation schemes. The proposed model compares the performance of both just-in-time (JIT) and just-enough-time (JET) signaling protocols associated with of void/non-void filling link scheduling schemes...

The paper addresses the problem of multi-slot just-in-time scheduling. Unlike the existing literature on this subject, it studies a more general criteria – the minimization of schedule makespan rather than the minimization of the number of slots used by schedule. It gives an O(n log n)-time optimization algorithm for the single machine problem. For arbitrary number of m > 1 identical parallel m...

Scheduling problems involving both earliness and tardiness costs have received significant attention in recent years. This type of problem became important with the advent of the justin-time (JIT) concept, where early or tardy deliveries are highly discouraged. In this work we examine the flowshop scheduling problem with no storage constraints and with blocking inprocess. In this latter environ...

This work aims to find out the full potential of compilation scheduling for JIT-based runtime systems. Compilation scheduling determines the order in which the compilation units (e.g., functions) in a program are to be compiled or recompiled. It decides when what versions of the units are ready to run, and hence affects performance. But it has been a largely overlooked direction in JIT-related ...

This paper reports a construction site intervention that is part of a research program devoted to the topic of production control in multi-story building construction. An early work by the authors introduced a preplanning method using the line of balance technique. This present work aggregates some tools previously used such as the Last Planner and Lookahead planning in order to develop a produ...

  In this paper, we consider a flow shop scheduling problem with bypass consideration for minimizing the sum of earliness and tardiness costs. We propose a new mathematical modeling to formulate this problem. There are several constraints which are involved in our modeling such as the due date of jobs, the job ready times, the earliness and the tardiness cost of jobs, and so on. We apply adapte...