The following pages link to Enrique Gerstl (Q339551):
Displaying 17 items.
- Scheduling problems with two competing agents to minimized weighted earliness-tardiness (Q339552) (← links)
- The optimal number of used machines in a two-stage flexible flowshop scheduling problem (Q398915) (← links)
- Scheduling on parallel identical machines with job-rejection and position-dependent processing times (Q456108) (← links)
- A note: Maximizing the weighted number of just-in-time jobs on a proportionate flowshop (Q477611) (← links)
- Due-window assignment problems with unit-time jobs (Q902534) (← links)
- Batch scheduling in a two-stage flexible flow shop problem (Q902743) (← links)
- Minmax scheduling with acceptable lead-times: extensions to position-dependent processing times, due-window and job rejection (Q1652303) (← links)
- Scheduling job classes on uniform machines (Q1761112) (← links)
- Due-window assignment with identical jobs on parallel uniform machines (Q2355801) (← links)
- Scheduling with two competing agents to minimize total weighted earliness (Q2399317) (← links)
- An improved algorithm for due-window assignment on parallel identical machines with unit-time jobs (Q2445244) (← links)
- Minmax due-date assignment with a time window for acceptable lead-times (Q2449349) (← links)
- A two-stage flow shop scheduling with a critical machine and batch availability (Q2978425) (← links)
- Single machine just‐in‐time scheduling problems with two competing agents (Q4632815) (← links)
- The LPT heuristic for minimizing total load on a proportionate openshop (Q6110607) (← links)
- A note: maximizing the weighted number of just-in-time jobs for a given job sequence (Q6136084) (← links)
- Coordinating scheduling and rejection decisions in a two-machine flow shop scheduling problem (Q6565431) (← links)
