The following pages link to Débora P. Ronconi (Q244627):
Displaying 28 items.
- (Q320007) (redirect page) (← links)
- List scheduling and beam search methods for the flexible job shop scheduling problem with sequencing flexibility (Q320008) (← links)
- A biased random key genetic algorithm for the field Technician scheduling problem (Q342506) (← links)
- Minimizing total tardiness in a stochastic single machine scheduling problem using approximate dynamic programming (Q633553) (← links)
- A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking (Q817122) (← links)
- Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date (Q947941) (← links)
- Tabu search for total tardiness minimization in flowshop scheduling problems (Q1302584) (← links)
- Minimization subproblems and heuristics for an applied clustering problem (Q1869508) (← links)
- Optimizing the packing of cylinders into a rectangular container: A nonlinear approach (Q1887860) (← links)
- Minimizing earliness and tardiness penalties in a single-machine problem with a common due date (Q1887879) (← links)
- New heuristics for total tardiness minimization in a flexible flowshop (Q1947616) (← links)
- Metaheuristics for the online printing shop scheduling problem (Q2030284) (← links)
- A filtered beam search method for the \(m\)-machine permutation flowshop scheduling problem minimizing the earliness and tardiness penalties and the waiting time of the jobs (Q2337385) (← links)
- A MILP model for an extended version of the flexible job shop problem (Q2448209) (← links)
- Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization (Q2496055) (← links)
- Mixed integer linear programming and constraint programming models for the online printing shop scheduling problem (Q2664355) (← links)
- Step cost functions in a fleet size and mix vehicle routing problem with time windows (Q2675711) (← links)
- Mixed-Integer Programming Models for Flowshop Scheduling Problems Minimizing the Total Earliness and Tardiness (Q2958669) (← links)
- Minimizing Total Tardiness: A Case Study in an Autoparts Factory (Q3148095) (← links)
- Method of sentinels for packing items within arbitrary convex regions (Q3418861) (← links)
- Optimizing transportation and storage of final products in the sugar and ethanol industry: a case study (Q3422370) (← links)
- Lower bounding schemes for flowshops with blocking in-process (Q4658520) (← links)
- The single machine earliness and tardiness scheduling problem: lower bounds and a branch-and-bound algorithm (Q5962398) (← links)
- The multiperiod two‐dimensional non‐guillotine cutting stock problem with usable leftovers (Q6069766) (← links)
- Relax-and-fix heuristics applied to a real-world lot sizing and scheduling problem in the personal care consumer goods industry (Q6168345) (← links)
- A forward-looking matheuristic approach for the multi-period two-dimensional non-guillotine cutting stock problem with usable leftovers (Q6373719) (← links)
- Models, constructive heuristics, and benchmark instances for the flexible job shop scheduling problem with sequencing flexibility and position-based learning effect (Q6527573) (← links)
- Local search and trajectory metaheuristics for the flexible job shop scheduling problem with sequencing flexibility and position-based learning effect (Q6527579) (← links)
