Pages that link to "Item:Q4689397"

The following pages link to A Branch-and-Bound Algorithm for Two-Agent Scheduling with Learning Effect and Late Work Criterion (Q4689397):

Displaying 9 items.

• Competitive two-agent scheduling with learning effect and release times on a single machine (Q474086) (← links)
• Single-machine scheduling with two competing agents and learning consideration (Q497627) (← links)
• Solving a two-agent single-machine scheduling problem considering learning effect (Q1762153) (← links)
• Single-machine scheduling with multi-agents to minimize total weighted late work (Q2197329) (← links)
• A two-stage three-machine flow shop assembly problem mixed with a controllable number and sum-of-processing times-based learning effect by simulated annealing algorithms (Q2213408) (← links)
• Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date (Q2301935) (← links)
• Scheduling with competing agents, total late work and job rejection (Q2668778) (← links)
• Proportionate Flow Shop Scheduling with Two Competing Agents to Minimize Weighted Late Work and Weighted Number of Late Jobs (Q5012893) (← links)
• Single-machine preemptive scheduling with release dates involving the total weighted late work criterion (Q6093999) (← links)