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):
Displaying 33 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)
- On the flexibility of a decision theory-based heuristic for single machine scheduling (Q1628046) (← links)
- A mathematical model and heuristic algorithms for an unrelated parallel machine scheduling problem with sequence-dependent setup times, machine eligibility restrictions and a common server (Q1634053) (← links)
- Decomposition methods for cost and tardiness reduction in aircraft manufacturing flow lines (Q1634065) (← links)
- Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times (Q1652061) (← links)
- A batch-oblivious approach for complex job-shop scheduling problems (Q1695012) (← links)
- A genetic algorithm-based approach for single-machine scheduling with learning effect and release time (Q1717946) (← links)
- Metaheuristics for order scheduling problem with unequal ready times (Q1727107) (← links)
- A hybrid scheduling approach for a two-stage flexible flow shop with batch processing machines (Q1743651) (← links)
- Rule-based scheduling in wafer fabrication with due date-based objectives (Q1761232) (← links)
- Parallel machine scheduling with the total weighted delivery time performance measure in distributed manufacturing (Q2026991) (← links)
- A survey of scheduling with parallel batch (p-batch) processing (Q2076906) (← links)
- Job scheduling of diffusion furnaces in semiconductor fabrication facilities (Q2140148) (← links)
- Online scheduling of incompatible unit-length job families with lookahead (Q2250449) (← links)
- A vibration damping optimization algorithm for a parallel machines scheduling problem with sequence-independent family setup times (Q2285809) (← links)
- An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan (Q2450605) (← links)
- Performance evaluation of due-date based dispatching rules in dynamic scheduling of diffusion furnace (Q2656512) (← links)
- Online Scheduling of Incompatible Family Jobs with Equal Length on an Unbounded Parallel-Batch Machine with Job Delivery (Q4689384) (← links)
- Construction of Schedules for the Performance of Task Packages in Multi-Stage Systems when Forming Sets of Results and Limitations (Q5039314) (← links)
- A two-stage flow-shop scheduling problem with incompatible job families and limited waiting time (Q5059324) (← 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)
- Minimizing total earliness and tardiness on re-entrant batch processing machine with time windows (Q5861097) (← links)
- A Production Plan Considering Parallel Machines and Deteriorating Effects: Minimizing the Makespan in the Section of Steel Box Girder Processing (Q6135730) (← links)
