Pages that link to "Item:Q3378821"

The following pages link to Minimizing total flow time in the single-machine scheduling problem with periodic maintenance (Q3378821):

Displaying 29 items.

• Human resources scheduling to improve the product quality according to exhaustion limit (Q287639) (← links)
• Production-driven opportunistic maintenance for batch production based on MAM-APB scheduling (Q300062) (← links)
• Scheduling two parallel machines with machine-dependent availabilities (Q342363) (← links)
• Minimizing total completion time on a single machine with a flexible maintenance activity (Q613512) (← 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)
• Single machine batch scheduling to minimize the sum of total flow time and batch delivery cost with an unavailability interval (Q726392) (← links)
• Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval (Q841595) (← links)
• A note on worst-case performance of heuristics for maintenance scheduling problems (Q868400) (← links)
• Supply chain scheduling problem in the hospital with periodic working time on a single machine (Q887873) (← links)
• Minimizing the makespan in a single machine scheduling problems with flexible and periodic maintenance (Q967809) (← links)
• Scheduling a maintenance activity to minimize total weighted completion-time (Q1029850) (← links)
• Mathematical programming models for competitive two-agent single-machine scheduling with flexible periodic maintenance activities (Q1639885) (← links)
• Exact solution of the single-machine scheduling problem with periodic maintenances and sequence-dependent setup times (Q1754111) (← links)
• Minimizing the number of tardy jobs in a single-machine scheduling problem with periodic maintenance (Q1761146) (← links)
• Makespan minimization for two parallel machines scheduling with a periodic availability constraint: mathematical programming model, average-case analysis, and anomalies (Q1789450) (← links)
• Scheduling two machines that require multiple types of maintenance, for a single operation (Q1841155) (← links)
• Single-machine scheduling with maintenance activities and rejection (Q2218650) (← links)
• A single-machine scheduling problem with maintenance activities to minimize makespan (Q2266971) (← links)
• Heuristics for the single machine weighted sum of completion times scheduling problem with periodic maintenance (Q2301137) (← links)
• A two-machine flowshop scheduling problem with a separated maintenance constraint (Q2456646) (← links)
• Scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan (Q2482821) (← links)
• Single-machine scheduling with maintenance in a manufacturing system (Q2997966) (← links)
• Single machine scheduling with preventive maintenances (Q3055653) (← links)
• Minimising total flow-time on two parallel machines with planned downtimes and resumable jobs (Q3163792) (← links)
• SINGLE MACHINE SCHEDULING WITH FORBIDDEN INTERVALS AND JOB DELIVERY TIMES (Q3526523) (← links)
• (Q5115408) (← links)
• Scheduling with day shifts and breaks (Q6070109) (← links)
• Single-machine Scheduling Problems with Aging/Deteriorating Effect under an Optional Maintenance Activity Consideration (Q6102698) (← links)
• Single-machine scheduling with fixed periodic preventive maintenance to minimise the total weighted completion times (Q6484298) (← links)