Pages that link to "Item:Q2444850"

The following pages link to The complexity of two supply chain scheduling problems (Q2444850):

Displaying 10 items.

• The supplying chain scheduling with the cost constraint and subcontracting (Q471714) (← links)
• Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work (Q1673940) (← links)
• A note on the complexity of two supply chain scheduling problems (Q2059093) (← links)
• Single-machine Pareto-scheduling with multiple weighting vectors for minimizing the total weighted late works (Q2083387) (← links)
• Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date (Q2301935) (← links)
• Supply chain scheduling in assembly systems (Q2916905) (← links)
• Scheduling in a two-stage supply chain with uncertain parameters (Q2987882) (← links)
• (Q3132646) (← links)
• Two heuristic methods based on decomposition to the integrated multi-agent supply chain scheduling and distribution problem (Q5038175) (← links)
• Two-machine flow-shop scheduling to minimize total late work: revisited (Q5059191) (← links)