Note on scheduling with general learning curves to minimize the number of tardy jobs
From MaRDI portal
Publication:4671554
DOI10.1057/palgrave.jors.2601809zbMath1122.90356OpenAlexW2060365099MaRDI QIDQ4671554
Jeffrey B. Sidney, Gur Mosheiov
Publication date: 26 April 2005
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/palgrave.jors.2601809
Related Items (34)
A bicriteria parallel machine scheduling with a learning effect of setup and removal times ⋮ Single machine scheduling with past-sequence-dependent setup times and learning effects ⋮ The learning effect: getting to the core of the problem ⋮ Single-machine scheduling with general learning functions ⋮ On single processor scheduling problems with learning dependent on the number of processed jobs ⋮ Sum-of-processing-times-based two-agent single-machine scheduling with aging effects and tardiness ⋮ Several single-machine scheduling problems with general learning effects ⋮ Maximizing the weighted number of just-in-time jobs on a single machine with position-dependent processing times ⋮ A Bicriteria Scheduling Problem with a Learning Effect: Total Completion Time and Total Tardiness ⋮ Single-machine scheduling with autonomous and induced learning to minimize total weighted number of tardy jobs ⋮ Worst-case and numerical analysis of heuristic algorithms for flowshop scheduling problems with a time-dependent learning effect ⋮ Single-machine scheduling problems with time and position dependent processing times ⋮ Scheduling with deteriorating jobs and learning effects ⋮ Scheduling with learning effects and/or time-dependent processing times to minimize the weighted number of tardy jobs on a single machine ⋮ Minimizing total tardiness in a scheduling problem with a learning effect ⋮ Group scheduling with learning effect and random processing time ⋮ A bicriteria flowshop scheduling with a learning effect ⋮ Asynchronous stochastic learning curve effects in engineering-to-order customisation processes ⋮ A state-of-the-art review on scheduling with learning effects ⋮ Single-machine scheduling problems with an aging effect ⋮ Single-machine scheduling with learning effects and maintenance: a methodological note on some polynomial-time solvable cases ⋮ Fast algorithms for scheduling with learning effects and time-dependent processing times on a single machine ⋮ A new approach to the learning effect: Beyond the learning curve restrictions ⋮ Minimizing the number of tardy jobs on a proportionate flowshop with general position-dependent processing times ⋮ Single-machine group scheduling problems with deteriorated and learning effect ⋮ Single-machine scheduling with learning functions ⋮ Bi-criteria single machine scheduling problem with a learning effect: Aneja-Nair method to obtain the set of optimal sequences ⋮ Machine scheduling problems with a general learning effect ⋮ Single-machine scheduling problems with a learning effect matrix ⋮ Minimizing the total weighted completion time on a single machine scheduling with release dates and a learning effect ⋮ Single-machine scheduling problems with the time-dependent learning effect ⋮ Single-machine group scheduling problems with deteriorating and learning effect ⋮ Worst-case behavior of simple sequencing rules in flow shop scheduling with general position-dependent learning effects ⋮ Single machine scheduling problems with position-dependent processing times
This page was built for publication: Note on scheduling with general learning curves to minimize the number of tardy jobs
