Pages that link to "Item:Q2644259"
From MaRDI portal
The following pages link to Just-in-time scheduling. Models and algorithms for computer and manufacturing systems (Q2644259):
Displayed 31 items.
- Vehicle scheduling under the warehouse-on-wheels policy (Q266928) (← links)
- Minimizing weighted earliness-tardiness on parallel machines using hybrid metaheuristics (Q337323) (← links)
- A single machine carryover sequence-dependent group scheduling in PCB manufacturing (Q339574) (← links)
- Efficient constructive and composite heuristics for the permutation flowshop to minimise total earliness and tardiness (Q342504) (← links)
- Makespan minimization of multi-slot just-in-time scheduling on single and parallel machines (Q600836) (← links)
- Due dates assignment and JIT scheduling with equal-size jobs (Q976442) (← links)
- A new model for the preemptive earliness-tardiness scheduling problem (Q1013402) (← links)
- A new dynamic programming formulation for scheduling independent tasks with common due date on parallel machines (Q1040984) (← links)
- Algorithms for job scheduling problems with distinct time windows and general earliness/tardiness penalties (Q1652242) (← links)
- Minimizing the maximal ergonomic burden in intra-hospital patient transportation (Q1734337) (← links)
- The single machine weighted mean squared deviation problem (Q1753598) (← links)
- Scheduling unrelated parallel machines with optional machines and jobs selection (Q1762164) (← links)
- Pseudo-polynomial dynamic programming for an integrated due date assignment, resource allocation, production, and distribution scheduling model in supply chain scheduling (Q2009683) (← links)
- A multiproduct single machine economic production quantity (EPQ) inventory model with discrete delivery order, joint production policy and budget constraints (Q2178350) (← links)
- Webster sequences, apportionment problems, and just-in-time sequencing (Q2243136) (← links)
- Scheduling just-in-time part supply for mixed-model assembly lines (Q2275595) (← links)
- Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling (Q2286871) (← links)
- Exponential time algorithms for just-in-time scheduling problems with common due date and symmetric weights (Q2307497) (← links)
- A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems (Q2327956) (← links)
- Near-optimal heuristics for just-in-time jobs maximization in flow shop scheduling (Q2331444) (← links)
- Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries for multiple customers in supply chains (Q2355078) (← links)
- Fast neighborhood search for the single machine earliness-tardiness scheduling problem (Q2379655) (← links)
- A multi-objective optimization for preemptive identical parallel machines scheduling problem (Q2403115) (← links)
- Routing equal-size messages on a slotted ring (Q2434298) (← links)
- Single machine scheduling with unequal release times and idle insert for minimizing the sum of maximum earliness and tardiness (Q2450493) (← links)
- Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey (Q2958665) (← links)
- Just-in-Time Scheduling in Modern Mass Production Environment (Q2958673) (← links)
- Multi-agent scheduling in a no-wait flow shop system to maximize the weighted number of just-in-time jobs (Q5058931) (← links)
- Order Now, Pickup in 30 Minutes: Managing Queues with Static Delivery Guarantees (Q5106351) (← links)
- Minimizing earliness-tardiness costs in supplier networks -- a just-in-time truck routing problem (Q6106496) (← links)
- A review of synchronization problems in parts-to-picker warehouses (Q6167383) (← links)