Pages that link to "Item:Q1374418"

The following pages link to Current trends in deterministic scheduling (Q1374418):

Displaying 50 items.

• Total completion time minimization on multiple machines subject to machine availability and makespan constraints (Q319146) (← links)
• Integrated production scheduling and maintenance policy for robustness in a single machine (Q337021) (← links)
• Hybrid discrete differential evolution algorithm for biobjective cyclic hoist scheduling with reentrance (Q342566) (← links)
• Scheduling on same-speed processors with at most one downtime on each machine (Q429662) (← links)
• Machine scheduling with a maintenance interval and job delivery coordination (Q518131) (← links)
• Cost-based decision-making in middleware virtualization environments (Q531466) (← links)
• Minimizing total completion time on a single machine with a flexible maintenance activity (Q613512) (← links)
• Generating artificial chromosomes with probability control in genetic algorithm for machine scheduling problems (Q613776) (← links)
• Scheduling and constraint propagation (Q697570) (← links)
• A Lagrangian heuristic for satellite range scheduling with resource constraints (Q716351) (← links)
• Optimal algorithms for online scheduling on parallel machines to minimize the makespan with a periodic availability constraint (Q719260) (← links)
• Isomorphic scheduling problems (Q744639) (← links)
• Makespan minimization for parallel machines scheduling with multiple availability constraints (Q744645) (← links)
• The coordination of single-machine scheduling with availability constraints and delivery (Q747044) (← 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)
• Two-agent single machine scheduling with forbidden intervals (Q902407) (← 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)
• Genetic algorithm and its performance analysis for scheduling a single crane (Q1723433) (← links)
• Scheduling on uniform processors with at most one downtime on each machine (Q1751114) (← links)
• Preemptive scheduling with availability constraints to minimize total weighted completion times (Q1772973) (← links)
• Minimizing total earliness and tardiness for common due date single-machine scheduling with an unavailability interval (Q1793403) (← links)
• Two simulated annealing-based heuristics for the job shop scheduling problem (Q1806614) (← links)
• Deterministic job-shop scheduling: Past, present and future (Q1807948) (← 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)
• Route-enabling graph orientation problems (Q1939659) (← links)
• Scheduling in a multi-processor environment with deteriorating job processing times and decreasing values: the case of forest fires (Q1959184) (← links)
• Scheduling with limited machine availability (Q1969884) (← links)
• Multiple crane scheduling in a batch annealing process with no-delay constraints for machine unloading (Q2293995) (← links)
• Multi-level lot sizing and job shop scheduling with compressible process times: a cutting plane approach (Q2356184) (← links)