A comparative computational study for parallel-machine problems with sustainable manufacturing constraints
From MaRDI portal
Cites work
- A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times
- A survey of scheduling with controllable processing times
- A systematic review of permutation flow shop scheduling with due-date-related objectives
- An update on the comparison of MIP, CP and hybrid approaches for mixed resource allocation and scheduling
- Bi‐criteria formulation for green scheduling with unrelated parallel machines with sequence‐dependent setup times
- Controllable processing times in project and production management: analysing the trade-off between processing times and the amount of resources
- Energy-awareness scheduling of unrelated parallel machine scheduling problems with multiple resource constraints
- Formulations and an adaptive large neighborhood search for just-in-time scheduling of unrelated parallel machines with a common due window
- Handbook of constraint programming.
- Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness
- Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times
- Mixed-Integer Programming vs. Constraint Programming for Shop Scheduling Problems: New Results and Outlook
- NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness
- On single machine scheduling with resource constraint
- Optimal Scheduling of Tasks on Identical Parallel Processors
- Single Machine Scheduling to Minimize Total Late Work
This page was built for publication: A comparative computational study for parallel-machine problems with sustainable manufacturing constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6868574)
