Pages that link to "Item:Q3637390"

The following pages link to From Fluid Relaxations to Practical Algorithms for High-Multiplicity Job-Shop Scheduling: The Holding Cost Objective (Q3637390):

Displaying 12 items.

• Linear programming-based algorithms for the minimum makespan high multiplicity jobshop problem (Q490324) (← links)
• An asymptotically optimal algorithm for large-scale mixed job shop scheduling to minimize the makespan (Q511693) (← links)
• A fluid approach to large volume job shop scheduling (Q600845) (← links)
• Asymptotically optimal policy for stochastic job shop scheduling problem to minimize makespan (Q724743) (← links)
• An algorithm for the maximum revenue jobshop problem (Q958087) (← links)
• Exponential penalty function control of loss networks (Q1769408) (← links)
• Cyclic lot-sizing problems with sequencing costs (Q2061136) (← links)
• Asymptotically optimal schedules for single-server flow shop problems with setup costs and times (Q2488240) (← links)
• The asymptotic performance ratio of an on-line algorithm for uniform parallel machine scheduling with release dates (Q2490322) (← links)
• Static Routing in Stochastic Scheduling: Performance Guarantees and Asymptotic Optimality (Q5131543) (← links)
• Applications of fluid models in service operations management (Q6163558) (← links)
• A hybrid fluid master–apprentice evolutionary algorithm for large-scale multiplicity flexible job-shop scheduling with sequence-dependent set-up time (Q6495522) (← links)