The following pages link to Reha Uzsoy (Q204949):
Displaying 48 items.
- A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families (Q878578) (← links)
- Rapid modeling and discovery of priority dispatching rules: An autonomous learning approach (Q880526) (← links)
- Hybrid decomposition heuristics for solving large-scale scheduling problems in semiconductor wafer fabrication (Q880579) (← links)
- Incorporating manufacturing lead times in joint production-marketing models: A review and some future directions (Q940927) (← links)
- Heuristics for capacity planning problems with congestion (Q1000984) (← links)
- A genetic algorithm for a single product network design model with lead time and safety stock considerations (Q1014964) (← links)
- A new dynamic programming algorithm for the parallel machines total weighted completion time problem (Q1197881) (← links)
- Media streams scheduling for synchronization in distributed multimedia systems (Q1288553) (← links)
- Benchmarks for shop scheduling problems (Q1296703) (← links)
- A capacity allocation problem with integer side constraints (Q1296707) (← links)
- Worst-case error bounds for parallel machine scheduling problems with bounded sequence-dependent setup times (Q1318658) (← links)
- A robust strategy approach to a strategic mobility problem (Q1342065) (← links)
- Rescheduling on a single machine with part-type dependent setup times and deadlines (Q1374422) (← links)
- Rolling horizon procedures for the single machine deterministic total completion time scheduling problem with release dates (Q1374424) (← links)
- Decomposition methods for reentrant flow shops with sequence-dependent setup times (Q1579123) (← links)
- Robust optimization approaches for the equitable and effective distribution of donated food (Q1750466) (← links)
- Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centers (Q1776965) (← links)
- Rounding heuristics for multiple product dynamic lot-sizing in the presence of queueing behavior (Q1782155) (← links)
- Executing production schedules in the face of uncertainties: a review and some future directions (Q1887777) (← links)
- An iterative heuristic for the single machine dynamic total completion time scheduling problem (Q1919773) (← links)
- Conic programming models for production planning with clearing functions: formulations and duality (Q2030464) (← links)
- Integrated and hierarchical systems for coordinating order acceptance and release planning (Q2160519) (← links)
- Valid inequalities for concave piecewise linear regression (Q2294266) (← links)
- Minimizing total completion time on a batch processing machine with job families (Q2367392) (← links)
- Heuristics for minimizing maximum lateness on a single machine with family-dependent set-up times (Q2462548) (← links)
- A computational study of shifting bottleneck procedures for shop scheduling problems (Q2567845) (← links)
- Short-term capacity allocation problem with tool and setup constraints (Q3442914) (← links)
- Integrating a decomposition procedure with problem reduction for factory scheduling with disruptions: a simulation study (Q3605414) (← links)
- Production planning with resources subject to congestion (Q3621923) (← links)
- Scheduling semiconductor test operations: Minimizing maximum lateness and number of tardy jobs on a single machine (Q3989986) (← links)
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations (Q4022933) (← links)
- Minimizing makespan on a single batch processing machine with dynamic job arrivals (Q4245414) (← links)
- Control of a batch-processing machine: A computational approach (Q4245710) (← links)
- Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times (Q4394265) (← links)
- Scheduling a single batch processing machine with non-identical job sizes (Q4394297) (← links)
- Scheduling batch processing machines with incompatible job families (Q4399080) (← links)
- Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup times (Q4399116) (← links)
- Predictable scheduling of a single machine with breakdowns and sensitive jobs (Q4497203) (← links)
- Performance of decomposition procedures for job shop scheduling problems with bottleneck machines (Q4497287) (← links)
- Machine Criticality Measures and Subproblem Solution Procedures in Shifting Bottleneck Methods: A Computational Study (Q4717125) (← links)
- Managing Product Transitions: A Bilevel Programming Approach (Q5058022) (← links)
- Learning effective dispatching rules for batch processor scheduling (Q5385460) (← links)
- Outbound supply chain network design with mode selection and lead time considerations (Q5433532) (← links)
- Single-machine scheduling with dynamic arrivals: Decomposition results and an improved algorithm (Q5687644) (← links)
- Integrating interval estimates of global optima and local search methods for combinatorial optimization problems (Q5944360) (← links)
- Experimental evaluation of heuristic optimization algorithms: A tutorial (Q5944365) (← links)
- Coordination of manufacturing and engineering activities during product transitions (Q6051587) (← links)
- Constraint violation reduction search for 0–1 mixed integer linear programming problems (Q6094312) (← links)
