Just-in-time scheduling. Models and algorithms for computer and manufacturing systems
From MaRDI portal
Publication:2644259
DOI10.1007/978-0-387-71718-0zbMath1129.90003OpenAlexW609209804MaRDI QIDQ2644259
Publication date: 7 September 2007
Published in: International Series in Operations Research \& Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-0-387-71718-0
Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (31)
Vehicle scheduling under the warehouse-on-wheels policy ⋮ Fast neighborhood search for the single machine earliness-tardiness scheduling problem ⋮ Multi-agent scheduling in a no-wait flow shop system to maximize the weighted number of just-in-time jobs ⋮ Minimizing weighted earliness-tardiness on parallel machines using hybrid metaheuristics ⋮ Algorithms for job scheduling problems with distinct time windows and general earliness/tardiness penalties ⋮ 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 multi-objective optimization for preemptive identical parallel machines scheduling problem ⋮ Makespan minimization of multi-slot just-in-time scheduling on single and parallel machines ⋮ A multiproduct single machine economic production quantity (EPQ) inventory model with discrete delivery order, joint production policy and budget constraints ⋮ Order Now, Pickup in 30 Minutes: Managing Queues with Static Delivery Guarantees ⋮ Minimizing earliness-tardiness costs in supplier networks -- a just-in-time truck routing problem ⋮ Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey ⋮ Just-in-Time Scheduling in Modern Mass Production Environment ⋮ A review of synchronization problems in parts-to-picker warehouses ⋮ 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 ⋮ Minimizing the maximal ergonomic burden in intra-hospital patient transportation ⋮ Webster sequences, apportionment problems, and just-in-time sequencing ⋮ 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 ⋮ Due dates assignment and JIT scheduling with equal-size jobs ⋮ Scheduling just-in-time part supply for mixed-model assembly lines ⋮ Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling ⋮ A new model for the preemptive earliness-tardiness scheduling problem ⋮ Exponential time algorithms for just-in-time scheduling problems with common due date and symmetric weights ⋮ A new dynamic programming formulation for scheduling independent tasks with common due date on parallel machines ⋮ 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
This page was built for publication: Just-in-time scheduling. Models and algorithms for computer and manufacturing systems
