Just-in-time scheduling. Models and algorithms for computer and manufacturing systems
From MaRDI portal
Publication:2644259
DOI10.1007/978-0-387-71718-0zbMATH Open1129.90003OpenAlexW609209804MaRDI QIDQ2644259FDOQ2644259
Authors: Joanna Józefowska 
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
Recommendations
Deterministic network models in operations research (90B10) Deterministic scheduling theory in operations research (90B35) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Cited In (43)
- Scheduling just-in-time part supply for mixed-model assembly lines
- Minmax common due-window assignment scheduling with deteriorating jobs
- Exponential time algorithms for just-in-time scheduling problems with common due date and symmetric weights
- Routing equal-size messages on a slotted ring
- Vehicle scheduling under the warehouse-on-wheels policy
- Estimating the parameters of distributed productive just-in-time systems
- Minimizing the maximal ergonomic burden in intra-hospital patient transportation
- The single machine weighted mean squared deviation problem
- Title not available (Why is that?)
- A multiproduct single machine economic production quantity (EPQ) inventory model with discrete delivery order, joint production policy and budget constraints
- Pseudo-polynomial dynamic programming for an integrated due date assignment, resource allocation, production, and distribution scheduling model in supply chain scheduling
- Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey
- Webster sequences, apportionment problems, and just-in-time sequencing
- The maximum deviation just-in-time scheduling problem.
- A dynamic programming algorithm for scheduling mixed-model, just-in-time production systems
- Multi-agent scheduling in a no-wait flow shop system to maximize the weighted number of just-in-time jobs
- Makespan minimization of multi-slot just-in-time scheduling on single and parallel machines
- Simultaneous optimization of classical objectives in JIT scheduling
- Solution of the Liu-Layland problem via bottleneck just-in-time sequencing
- A single machine carryover sequence-dependent group scheduling in PCB manufacturing
- Algorithms for job scheduling problems with distinct time windows and general earliness/tardiness penalties
- Exact and heuristic algorithms for the just-in-time scheduling problem in a batch processing system
- A review of synchronization problems in parts-to-picker warehouses
- Order now, pickup in 30 minutes: managing queues with static delivery guarantees
- A new dynamic programming formulation for scheduling independent tasks with common due date on parallel machines
- Minimizing weighted earliness-tardiness on parallel machines using hybrid metaheuristics
- Efficient constructive and composite heuristics for the permutation flowshop to minimise total earliness and tardiness
- Fast neighborhood search for the single machine earliness-tardiness scheduling problem
- Proportional optimization and fairness
- Just-in-time scheduling in modern mass production environment
- Scheduling in green supply chain management. A mixed-integer approach
- Near-optimal heuristics for just-in-time jobs maximization in flow shop scheduling
- A new model for the preemptive earliness-tardiness scheduling problem
- Single machine scheduling with unequal release times and idle insert for minimizing the sum of maximum earliness and tardiness
- Minimizing earliness-tardiness costs in supplier networks -- a just-in-time truck routing problem
- Due dates assignment and JIT scheduling with equal-size jobs
- A multi-objective optimization for preemptive identical parallel machines scheduling problem
- A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems
- Multicriteria models for just-in-time scheduling
- INEH-VNS algorithm solved automatic production system scheduling problem under just-in-time environment
- Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling
- Scheduling unrelated parallel machines with optional machines and jobs selection
- 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2644259)
