Pages that link to "Item:Q1173857"

The following pages link to A multi-objective approach to resource allocation in single machine scheduling (Q1173857):

Displaying 20 items.

• Improving fleet utilization for carriers by interval scheduling (Q439488) (← links)
• Single machine batch scheduling to minimize total completion time and resource consumption costs (Q835561) (← links)
• Optimal control strategies for single-machine family scheduling with sequence-dependent batch setup and controllable processing times (Q892912) (← links)
• The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times (Q940868) (← links)
• Multiple and bicriteria scheduling: A literature survey (Q1130028) (← links)
• An approximation algorithm for the \(m\)-machine permutation flow shop scheduling problem with controllable processing times (Q1310020) (← links)
• An approximation algorithm for a single-machine scheduling problem with release times, delivery times and controllable processing times (Q1319563) (← links)
• Incorporating preference information into multi-objective scheduling (Q1333459) (← links)
• A bicriterion objective for levelling the schedule of a mixed-model, \(JIT\) assembly process (Q1341405) (← links)
• Resource cost aware scheduling (Q1750475) (← links)
• Convex resource allocation for minimizing the makespan in a single machine with job release dates (Q1881652) (← links)
• A heuristic approach for minimizing weighted tardiness and overtime costs in single resource scheduling (Q1885984) (← links)
• Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine (Q1885985) (← links)
• Minimizing the total weighted flow time in a single machine with controllable processing times (Q1886005) (← links)
• A bicriterion approach to preemptive scheduling of parallel machines with controllable job processing times (Q1917233) (← links)
• A tabu-search heuristic for the flexible-resource flow shop scheduling problem (Q2367002) (← links)
• A survey of scheduling with controllable processing times (Q2381529) (← links)
• A bicriterion approach to time/cost trade-offs in scheduling with convex resource-dependent job processing times and release dates (Q2489138) (← links)
• Parallel machine scheduling with a convex resource consumption function (Q2491771) (← links)
• Single‐machine common flow allowance scheduling with aging effect, resource allocation, and a rate‐modifying activity (Q5744000) (← links)