Just-in-time scheduling. Models and algorithms for computer and manufacturing systems
More than 50 years ago, just-in-time production was introduced by the Japanese car manufacturer Toyota and, subsequently, Toyota became the most successful car manufacturer of the world. Despite the title, the book deals not in the first instance with just-in-time production, but with the algorithms used to solve the corresponding optimization problems. In the first chapter the problem of just-in-time production is described for manufacturing processes and computer systems, which have to work in real time. The advantages are listed and the difficulties outlined. Just-in-time is the result of an optimal scheduling under side conditions. The given due dates constitute the side conditions, while different functions of earliness and tardiness are used as optimality criterion. The second chapter contains the methodology used in deterministic scheduling theory. Actually, the book deals only with deterministic situations and does not cover random variations of the production times. The general problem is formulated using the approach developed in the theory of apportionment, which also yields a number of interesting properties. The next two chapters investigate special cases with respect to the nature of the due dates (common and individual), cost functions (linear and quadratic), schedules with idle times and without idle times and, in particular, with respect to the objective function. Finally, in the fifth and last chapter algorithms are introduced to balance schedules, i.e., the optimal order of products on the assembly line makes sure that the variation of the production volume at the manufacturing level is minimized. At first, the problem is formulated for the general case of a multi-level production process and, subsequently, the special case of a single-level process is considered, which leads to the so-called product rate variation problem (PRV). In each case different optimality criteria are considered. The connection between the PRV problem and the corresponding apportionment problem is discussed and, in the end, the case of scheduling periodic tasks is briefly dealt with.
- A new model for the preemptive earliness-tardiness scheduling problem
- A new dynamic programming formulation for scheduling independent tasks with common due date on parallel machines
- System-theoretic analysis of due-time performance in production systems
- The maximum deviation just-in-time scheduling problem.
- Exact and heuristic algorithms for the just-in-time scheduling problem in a batch processing system
- Algorithms for job scheduling problems with distinct time windows and general earliness/tardiness penalties
- Minimizing the maximal ergonomic burden in intra-hospital patient transportation
- The single machine weighted mean squared deviation problem
- Scheduling unrelated parallel machines with optional machines and jobs selection
- Pseudo-polynomial dynamic programming for an integrated due date assignment, resource allocation, production, and distribution scheduling model in supply chain scheduling
- Scheduling in green supply chain management. A mixed-integer approach
- A multiproduct single machine economic production quantity (EPQ) inventory model with discrete delivery order, joint production policy and budget constraints
- Webster sequences, apportionment problems, and just-in-time sequencing
- Scheduling just-in-time part supply for mixed-model assembly lines
- Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling
- Exponential time algorithms for just-in-time scheduling problems with common due date and symmetric weights
- A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems
- Near-optimal heuristics for just-in-time jobs maximization in flow shop scheduling
- Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries for multiple customers in supply chains
- Minimizing variation of production rates in just-in-time systems: A survey
- Fast neighborhood search for the single machine earliness-tardiness scheduling problem
- A multi-objective optimization for preemptive identical parallel machines scheduling problem
- Routing equal-size messages on a slotted ring
- Single machine scheduling with unequal release times and idle insert for minimizing the sum of maximum earliness and tardiness
- Vehicle scheduling under the warehouse-on-wheels policy
- Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey
- Just-in-time scheduling in modern mass production environment
- Multicriteria models for just-in-time scheduling
- Minimizing weighted earliness-tardiness on parallel machines using hybrid metaheuristics
- A single machine carryover sequence-dependent group scheduling in PCB manufacturing
- Efficient constructive and composite heuristics for the permutation flowshop to minimise total earliness and tardiness
- A branch-and-bound approach for machine selection in just-in-time manufacturing systems
- scientific article; zbMATH DE number 1537217 (Why is no real title available?)
- Multi-agent scheduling in a no-wait flow shop system to maximize the weighted number of just-in-time jobs
- Order now, pickup in 30 minutes: managing queues with static delivery guarantees
- A dynamic programming algorithm for scheduling mixed-model, just-in-time production systems
- Makespan minimization of multi-slot just-in-time scheduling on single and parallel machines
- Minimizing earliness-tardiness costs in supplier networks -- a just-in-time truck routing problem
- A review of synchronization problems in parts-to-picker warehouses
- INEH-VNS algorithm solved automatic production system scheduling problem under just-in-time environment
- Minmax common due-window assignment scheduling with deteriorating jobs
- Fifty years of research in scheduling -- theory and applications
- New heuristics for the 2-stage assembly scheduling problem with total earliness and tardiness minimisation: a computational evaluation
- Estimating the parameters of distributed productive just-in-time systems
- Simultaneous optimization of classical objectives in JIT scheduling
- Solution of the Liu-Layland problem via bottleneck just-in-time sequencing
- Proportional optimization and fairness
- Due dates assignment and JIT scheduling with equal-size jobs
This page was built for publication: Just-in-time scheduling. Models and algorithms for computer and manufacturing systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2644259)
