Pages that link to "Item:Q4671554"
From MaRDI portal
The following pages link to Note on scheduling with general learning curves to minimize the number of tardy jobs (Q4671554):
Displaying 34 items.
- On single processor scheduling problems with learning dependent on the number of processed jobs (Q350495) (← links)
- Maximizing the weighted number of just-in-time jobs on a single machine with position-dependent processing times (Q398882) (← links)
- Worst-case and numerical analysis of heuristic algorithms for flowshop scheduling problems with a time-dependent learning effect (Q425519) (← links)
- Scheduling with learning effects and/or time-dependent processing times to minimize the weighted number of tardy jobs on a single machine (Q474786) (← links)
- Single-machine scheduling problems with time and position dependent processing times (Q646660) (← links)
- Scheduling with deteriorating jobs and learning effects (Q654684) (← links)
- Worst-case behavior of simple sequencing rules in flow shop scheduling with general position-dependent learning effects (Q763108) (← links)
- A bicriteria parallel machine scheduling with a learning effect of setup and removal times (Q840149) (← links)
- Single machine scheduling with past-sequence-dependent setup times and learning effects (Q845955) (← links)
- A bicriteria flowshop scheduling with a learning effect (Q949943) (← links)
- Single-machine group scheduling problems with deteriorated and learning effect (Q972174) (← links)
- Single-machine scheduling with learning functions (Q972176) (← links)
- Bi-criteria single machine scheduling problem with a learning effect: Aneja-Nair method to obtain the set of optimal sequences (Q980085) (← links)
- Machine scheduling problems with a general learning effect (Q984120) (← links)
- Minimizing the total weighted completion time on a single machine scheduling with release dates and a learning effect (Q1004418) (← links)
- Single machine scheduling problems with position-dependent processing times (Q1032015) (← links)
- Sum-of-processing-times-based two-agent single-machine scheduling with aging effects and tardiness (Q1666548) (← links)
- Minimizing the number of tardy jobs on a proportionate flowshop with general position-dependent processing times (Q1762149) (← links)
- Single-machine scheduling problems with a learning effect matrix (Q1787789) (← links)
- Several single-machine scheduling problems with general learning effects (Q1930782) (← links)
- Single-machine scheduling with learning effects and maintenance: a methodological note on some polynomial-time solvable cases (Q1993121) (← links)
- Group scheduling with learning effect and random processing time (Q2240193) (← links)
- Fast algorithms for scheduling with learning effects and time-dependent processing times on a single machine (Q2253532) (← links)
- The learning effect: getting to the core of the problem (Q2379968) (← links)
- Single-machine scheduling with general learning functions (Q2389734) (← links)
- Minimizing total tardiness in a scheduling problem with a learning effect (Q2466609) (← links)
- A state-of-the-art review on scheduling with learning effects (Q2470096) (← links)
- Single-machine scheduling problems with an aging effect (Q2471338) (← links)
- A new approach to the learning effect: Beyond the learning curve restrictions (Q2483519) (← links)
- Single-machine scheduling problems with the time-dependent learning effect (Q2519645) (← links)
- Single-machine group scheduling problems with deteriorating and learning effect (Q2822286) (← links)
- Asynchronous stochastic learning curve effects in engineering-to-order customisation processes (Q3012663) (← links)
- A Bicriteria Scheduling Problem with a Learning Effect: Total Completion Time and Total Tardiness (Q6102812) (← links)
- Single-machine scheduling with autonomous and induced learning to minimize total weighted number of tardy jobs (Q6112732) (← links)
