A two-agent single-machine scheduling problem with learning and deteriorating considerations (Q473926): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Import240304020342 (talk | contribs)
Set profile property.
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 00:21, 5 March 2024

scientific article
Language Label Description Also known as
English
A two-agent single-machine scheduling problem with learning and deteriorating considerations
scientific article

    Statements

    A two-agent single-machine scheduling problem with learning and deteriorating considerations (English)
    0 references
    0 references
    24 November 2014
    0 references
    Summary: Recently, interest in scheduling with deteriorating jobs and learning effects has kept growing. However, research in this area has seldom considered the multiagent setting. Motivated by these observations, we consider two-agent scheduling on a single machine involving the learning effects and deteriorating jobs simultaneously. In the proposed model, we assume that the actual processing time of a job of the first (second) agent is a decreasing (increasing) function of the total processing time of the jobs already processed in a schedule. The objective is to minimize the total weighted completion time of the jobs of the first agent with the restriction that no tardy job is allowed for the second agent. We develop a branch-and-bound and a simulated annealing algorithms for the problem. We perform extensive computational experiments to test the performance of the algorithms.
    0 references

    Identifiers