Pages that link to "Item:Q2384614"

The following pages link to Parallel machine scheduling with machine availability and eligibility constraints (Q2384614):

Displaying 21 items.

• Minimizing resource consumption on uniform parallel machines with a bound on makespan (Q336672) (← links)
• Performance guarantees of jump neighborhoods on restricted related parallel machines (Q453054) (← links)
• Approximation schemes for parallel machine scheduling with availability constraints (Q642981) (← links)
• Solving an integrated job-shop problem with human resource constraints (Q744642) (← links)
• Makespan minimization for parallel machines scheduling with multiple availability constraints (Q744645) (← links)
• Parallel-machine serial-batching scheduling with release times under the effects of position-dependent learning and time-dependent deterioration (Q829191) (← links)
• A note on ``scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan'' (Q1015007) (← links)
• Exponential inapproximability and FPTAS for scheduling with availability constraints (Q1029337) (← links)
• Scheduling jobs with maintenance subject to load-dependent duration on a single machine (Q1664968) (← links)
• Multiobjective order acceptance and scheduling on unrelated parallel machines with machine eligibility constraints (Q1721157) (← links)
• A novel integrated condition-based maintenance and stochastic flexible job shop scheduling problem: simulation-based optimization approach (Q1730479) (← links)
• Scheduling uniform parallel dedicated machines with job splitting, sequence-dependent setup times, and multiple servers (Q2026982) (← links)
• Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness (Q2108098) (← links)
• Developing a flexible manufacturing control system considering mixed uncertain predictive maintenance model: a simulation-based optimization approach (Q2241323) (← links)
• Heuristics for online scheduling on identical parallel machines with two GoS levels (Q2320626) (← links)
• A new approach based on the learning effect for sequence-dependent parallel machine scheduling problem under uncertainty (Q2676000) (← links)
• Minimising makespan on parallel machines with precedence constraints and machine eligibility restrictions (Q3163694) (← links)
• MAKESPAN MINIMIZATION WITH MACHINE AVAILABILITY CONSTRAINTS (Q3397506) (← links)
• Approximation algorithms for scheduling with reservations (Q5961975) (← links)
• The parallel AGV scheduling problem with battery constraints: a new formulation and a matheuristic approach (Q6109805) (← links)
• Generalizing Horn's conditions for preemptive scheduling on identical parallel machines via network flow techniques (Q6196891) (← links)