Pages that link to "Item:Q1599325"
From MaRDI portal
The following pages link to Set-up coordination between two stages of a supply chain (Q1599325):
Displaying 15 items.
- Green scheduling of a two-machine flowshop: trade-off between makespan and energy consumption (Q320777) (← links)
- Scheduling deteriorating jobs on a single serial-batching machine with multiple job types and sequence-dependent setup times (Q513627) (← links)
- A lower bound on the Hamiltonian path completion number of a line graph (Q902504) (← links)
- The scheduling of deliveries in a production-distribution system with multiple buyers (Q940913) (← links)
- A linear algorithm for the Hamiltonian completion number of the line graph of a cactus. (Q1427178) (← links)
- A linear algorithm for the Hamiltonian completion number of the line graph of a tree (Q1603430) (← links)
- Coordination in a two-stage production system: complexity, conflict and cooperation (Q1762107) (← links)
- Optimally rescheduling jobs with a last-in-first-out buffer (Q2066687) (← links)
- Setup coordination between two stages of a production system: a multi-objective evolutionary approach (Q2379870) (← links)
- Supply chain scheduling: sequence coordination (Q2433797) (← links)
- Local search algorithms for finding the Hamiltonian completion number of line graphs (Q2468757) (← links)
- A bi-objective coordination setup problem in a two-stage production system (Q2482750) (← links)
- Coordination of set-ups between two stages of a supply chain using multi-objective genetic algorithms (Q3369502) (← links)
- Minimum Dominating Trail Set for Two-Terminal Series Parallel Graphs (Q3439140) (← links)
- Bi‐criteria formulation for green scheduling with unrelated parallel machines with sequence‐dependent setup times (Q6070133) (← links)
