Pages that link to "Item:Q1781549"
From MaRDI portal
The following pages link to Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times (Q1781549):
Displayed 15 items.
- Design of automated negotiation mechanisms for decentralized heterogeneous machine scheduling (Q320651) (← links)
- A novel approach to hedge and compensate the critical dimension variation of the developed-and-etched circuit patterns for yield enhancement in semiconductor manufacturing (Q337307) (← links)
- Bicriteria scheduling problem for unrelated parallel machines with release dates (Q342063) (← links)
- Particle swarm optimization algorithm for unrelated parallel machine scheduling with release dates (Q473611) (← links)
- Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems (Q622134) (← links)
- Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes (Q693407) (← links)
- Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops (Q857354) (← links)
- A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes (Q941534) (← links)
- Minimizing makespan for multi-spindle head machines with a mobile table (Q954031) (← links)
- A memetic algorithm for minimizing total weighted tardiness on parallel batch machines with incompatible job families and dynamic job arrival (Q991390) (← links)
- Rule-based scheduling in wafer fabrication with due date-based objectives (Q1761232) (← links)
- Online scheduling of incompatible unit-length job families with lookahead (Q2250449) (← links)
- An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan (Q2450605) (← links)
- Minimizing total weighted tardiness on a batch-processing machine with incompatible job families and job ready times (Q5444602) (← links)
- Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes (Q5478853) (← links)