Pages that link to "Item:Q1374418"
From MaRDI portal
The following pages link to Current trends in deterministic scheduling (Q1374418):
Displayed 40 items.
- Scheduling and constraint propagation (Q697570) (← links)
- Bicriteria robotic cell scheduling (Q835626) (← links)
- Heuristics for two-machine flowshop scheduling with setup times and an availability constraint (Q850314) (← links)
- Mass customization in videotape duplication and conversion: challenges of flexible duplication systems, fast delivery, and electronic service (Q850876) (← links)
- A simple linear time approximation algorithm for multi-processor job scheduling on four processors (Q867026) (← links)
- Scheduling machine-dependent jobs to minimize lateness on machines with identical speed under availability constraints (Q868990) (← links)
- An approximation scheme for two-machine flowshop scheduling with setup times and an availability constraint (Q878557) (← links)
- A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks (Q880507) (← links)
- Maximizing business value by optimal assignment of jobs to resources in grid computing (Q958577) (← links)
- Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms (Q965714) (← links)
- Mathematical models for job-shop scheduling problems with routing and process plan flexibility (Q988383) (← links)
- Optimization of processing and delivery decisions involving third-party machines (Q1000038) (← links)
- Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics (Q1017464) (← links)
- Exponential inapproximability and FPTAS for scheduling with availability constraints (Q1029337) (← links)
- Identical parallel-machine scheduling under availability constraints to minimize the sum of completion times (Q1042030) (← links)
- Two-machine flowshop scheduling with availability constraints (Q1296377) (← links)
- Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop. (Q1399584) (← links)
- Hybrid flow-shop scheduling problems with multiprocessor task systems. (Q1410328) (← links)
- Uniform machine scheduling with machine available constraints (Q1568243) (← links)
- Machine scheduling with a rate-modifying activity (Q1592740) (← links)
- Heuristics for two-machine no-wait flowshop scheduling with an availability constraint (Q1607139) (← links)
- Preemptive scheduling with availability constraints to minimize total weighted completion times (Q1772973) (← links)
- Two simulated annealing-based heuristics for the job shop scheduling problem (Q1806614) (← links)
- Optimal online algorithm for scheduling on two identical machines with machine availability constraints. (Q1853092) (← links)
- A multiprocessor task scheduling model for berth allocation: Heuristic and worst-case analysis (Q1866998) (← links)
- Makespan minimization for two parallel machines with an availability constraint (Q1887910) (← links)
- Mean flow time minimization with given bounds of processing times (Q1887954) (← links)
- Scheduling with limited machine availability (Q1969884) (← links)
- Parallel machine scheduling with machine availability and eligibility constraints (Q2384614) (← links)
- An efficient algorithm for multi-hoist cyclic scheduling with fixed processing times (Q2466598) (← links)
- Scheduling two-stage hybrid flow shop with availability constraints (Q2496033) (← links)
- Scheduling linear deteriorating jobs with an availability constraint on a single machine (Q2508968) (← links)
- A particle swarm optimization algorithm for hybrid flow-shop scheduling with multiprocessor tasks (Q3527950) (← links)
- Single-track multi-hoist scheduling problem: a collision-free resolution based on a branch-and-bound approach (Q4671265) (← links)
- (Q4949162) (← links)
- Scheduling jobs with service level requirements on parallel machines under availability and eligibility constraints (Q5188149) (← links)
- INTERVAL-VALUED REPRESENTABILITY OF QUALITATIVE DATA: THE CONTINUOUS CASE (Q5297802) (← links)
- Lot streaming in a multiple product permutation flow shop with intermingling (Q5444605) (← links)
- Optimality of Jackson's permutations with respect to limited machine availability (Q5488246) (← links)
- Single-machine scheduling with maintenance and repair rate-modifying activities (Q5955079) (← links)