Pages that link to "Item:Q1969884"

The following pages link to Scheduling with limited machine availability (Q1969884):

Displaying 50 items.

• Improving the performance of metaheuristics: an approach combining response surface methodology and racing algorithms (Q277580) (← links)
• Approximation algorithms for the single-machine scheduling with a period of maintenance (Q279822) (← links)
• A branch-and-bound method for the single-machine scheduling problem under a non-availability constraint for maximum delivery time minimization (Q298761) (← links)
• Total completion time minimization on multiple machines subject to machine availability and makespan constraints (Q319146) (← links)
• A real-time order acceptance and scheduling approach for permutation flow shop problems (Q320020) (← links)
• Efficient approximation schemes for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability interval (Q326506) (← links)
• Integrated production scheduling and maintenance policy for robustness in a single machine (Q337021) (← links)
• Scheduling optimization of a stochastic flexible job-shop system with time-varying machine failure rate (Q337585) (← links)
• Patient scheduling with periodic deteriorating maintenance on single medical device (Q342021) (← links)
• Two meta-heuristic algorithms for solving multi-objective flexible job-shop scheduling with parallel machine and maintenance constraints (Q356114) (← links)
• Parallel machines scheduling with machine maintenance for minsum criteria (Q421521) (← links)
• Scheduling on same-speed processors with at most one downtime on each machine (Q429662) (← links)
• Unrelated parallel-machine scheduling with rate-modifying activities to minimize the total completion time (Q433105) (← links)
• Approximation algorithms for maximizing the weighted number of early jobs on a single machine with non-availability intervals (Q498410) (← links)
• Bounding strategies for the hybrid flow shop scheduling problem (Q545969) (← links)
• A heuristic approach for a scheduling problem with periodic maintenance and sequence-dependent setup times (Q552221) (← links)
• Minimizing total completion time on a single machine with a flexible maintenance activity (Q613512) (← links)
• Minimizing the total completion time in single-machine scheduling with aging/deteriorating effects and deteriorating maintenance activities (Q623150) (← links)
• Bicriteria scheduling concerned with makespan and total completion time subject to machine availability constraints (Q631768) (← links)
• Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release dates (Q640300) (← links)
• Approximation schemes for parallel machine scheduling with availability constraints (Q642981) (← links)
• Single machine scheduling with semi-resumable machine availability constraints (Q655762) (← links)
• Scheduling with tool changes to minimize total completion time: Basic results and SPT performance (Q703937) (← links)
• Scheduling jobs under increasing linear machine maintenance time (Q707693) (← links)
• An optimal semi-online algorithm for 2-machine scheduling with an availability constraint (Q719024) (← links)
• Unrelated parallel-machine scheduling with deterioration effects and deteriorating multi-maintenance activities for minimizing the total completion time (Q727300) (← links)
• Minimizing the total completion time on a single machine with the learning effect and multiple availability constraints (Q727323) (← 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)
• The coordination of single-machine scheduling with availability constraints and delivery (Q747044) (← links)
• Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval (Q841595) (← links)
• Heuristics for two-machine flowshop scheduling with setup times and an availability constraint (Q850314) (← links)
• Optimal scheduling of a two-stage hybrid flow shop (Q857819) (← links)
• Single-machine scheduling with periodic maintenance to minimize makespan (Q858282) (← links)
• Scheduling with tool changes to minimize total completion time under controllable machining conditions (Q868153) (← links)
• A note on worst-case performance of heuristics for maintenance scheduling problems (Q868400) (← links)
• Scheduling machine-dependent jobs to minimize lateness on machines with identical speed under availability constraints (Q868990) (← links)
• Scheduling deteriorating jobs subject to job or machine availability constraints (Q869201) (← links)
• An approximation scheme for two-machine flowshop scheduling with setup times and an availability constraint (Q878557) (← links)
• Two machine scheduling under disruptions with transportation considerations (Q880527) (← links)
• A two-stage coupled algorithm for an integrated maintenance planning and flowshop scheduling problem with deteriorating machines (Q892903) (← links)
• Optimal control strategies for single-machine family scheduling with sequence-dependent batch setup and controllable processing times (Q892912) (← links)
• Two-agent single machine scheduling with forbidden intervals (Q902407) (← links)
• Parallel machine scheduling with almost periodic maintenance and non-preemptive jobs to minimize makespan (Q941557) (← links)
• Minimizing the makespan in a single machine scheduling problems with flexible and periodic maintenance (Q967809) (← links)
• Optimization of processing and delivery decisions involving third-party machines (Q1000038) (← links)
• Computing lower and upper bounds for a large-scale industrial job shop scheduling problem (Q1011298) (← links)
• Minimizing the sum of job completion times on capacitated two-parallel machines (Q1014943) (← links)
• Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics (Q1017464) (← links)
• Approximation algorithms for single machine scheduling with one unavailability period (Q1022445) (← links)