Journal Article10.1007/S10951-006-0002-8
Response time variability
TL;DR: A position exchange heuristic is proposed and applied to improve the total response time variability of an initial sequence and the latter is the optimum bottleneck sequence, Webster or Jefferson sequence of the apportionment, or a random sequence.
read more
Abstract: Response time variability is a new optimization problem with a broad range of applications and a distinctive number of theoretic flavour. The problem occurs whenever events, jobs, clients or products need to be sequenced so as to minimize the variability of time for which they wait for the next turn in obtaining the resources necessary for their advance. The problem has numerous real-life applications. We study its computational complexity, present efficiency, polynomial time algorithms for some cases, and the NP-hardness proof for a general problem. We propose a position exchange heuristic and apply it to improve the total response time variability of an initial sequence. The latter is the optimum bottleneck sequence, Webster or Jefferson sequence of the apportionment, or a random sequence. We report on computational experiments with the heuristic.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Sequencing mixed-model assembly lines: Survey, classification and model critique
TL;DR: This paper reviews and discusses the three major planning approaches presented in the literature, mixed-model sequencing, car sequencing and level scheduling, and provides a hierarchical classification scheme to systematically record the academic efforts in each field and to deduce future research issues.
476
Introducing dynamic diversity into a discrete particle swarm optimization
TL;DR: 10 discrete PSO algorithms for solving the response time variability problem (RTVP) are proposed: one based on the ideas described above (PSO-c"3dyn) and nine based on strategies proposed in the literature and adapted for solving a discrete optimization problem such as the RTVP.
64
The product rate variation problem and its relevance in real world mixed-model assembly lines
TL;DR: It is concluded that the popular product rate variation (PRV) is in fact inappropriate for use in today's real world mixed-model assembly systems.
41
Mathematical programming modeling of the Response Time Variability Problem
TL;DR: This paper aims to improve the best mathematical programming model developed thus far in order to solve larger instances up to 40 units to optimality to rival the MILP solution efficiency for the RTVP.
32
Level Scheduling for batched JIT supply
TL;DR: The paper on hand provides new Level Scheduling models, proves complexity, presents exact and heuristic solution procedures and shows inferiority of traditional Level Scheduled for such a batched JIT-supply of parts.
References
Toyota production system
TL;DR: This new edition of Toyota Production System: An Integrated Approach to Just-In-Time updates the classic with new material on e-kanban, mini-profit centers, computer-based information systems, and innovative solutions to common obstacles in TPS implementation.
1.8K
A probabilistic heuristic for a computationally difficult set covering problem
TL;DR: An efficient probabilistic set covering heuristic is presented that provides the best known solutions to all other instances attempted to solve set covering problems that arise from Steiner triple systems.
1.1K
Level schedules for mixed-model assembly lines in just-in-time production systems
TL;DR: A theoretical basis for scheduling mixed-model assembly lines and Just-In-Time JIT production systems is developed, and new scheduling algorithms and heuristics are presented.
471
Minimizing variation of production rates in just-in-time systems: A survey☆
TL;DR: In the past several years, there has been growing interest in scheduling problems where jobs are penalized both for being early and for being tardy as mentioned in this paper, and a number of excellent surveys on these problems have appeared over the last four years.
209
Level Schedules for Mixed-Model, Just-in-Time Processes
George Steiner,Scott Yeomans +1 more
TL;DR: In this article, a graph-theoretic approach is used to determine an optimal solution for this goal for a new, nonconvex objective function, and a schedule always exists such that, at all times, the deviation of actual production from the desired level of production for every product is never more than one unit.
155