The following pages link to Marino Widmer (Q596435):
Displaying 10 items.
- Mixed integer programming to schedule a single-shift workforce under annualized hours (Q596436) (← links)
- A flexible MILP model for multiple-shift workforce planning under annualized hours (Q1044115) (← links)
- A new heuristic method for the flow shop sequencing problem (Q1119464) (← links)
- FUN: a dynamic method for scheduling problems (Q1388821) (← links)
- A case study of single shift planning and scheduling under annualized hours: a simple three-step approach. (Q1417499) (← links)
- An improved tabu search approach for solving the job shop scheduling problem with tooling constraints (Q1917279) (← links)
- Integer linear programming models for a cement delivery problem (Q1926974) (← links)
- Metaheuristics for a scheduling problem with rejection and tardiness penalties (Q2018941) (← links)
- Layout modeling and construction procedure for the arrangement of exhibition spaces in a fair (Q4454767) (← links)
- Évaluation des performances d'un atelier flexible en tenant compte des pannes et des maintenances (Q4723547) (← links)
