Due-window assignment and scheduling with multiple rate-modifying activities under the effects of deterioration and learning (Q541440): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(6 intermediate revisions by 6 users not shown) | |||
Property / author | |||
Property / author: Ming Liu / rank | |||
Property / author | |||
Property / author: Ming Liu / rank | |||
Normal rank | |||
Property / review text | |||
Summary: This paper discusses due-window assignment and scheduling with multiple rate-modifying activities. Multiple types of rate-modifying activities are allowed to perform on a single machine. The learning effect and job deterioration are also integrated concurrently into the problem which makes the problem more realistic. The objective is to find jointly the optimal location to perform multiple rate-modifying activities, the optimal job sequence, and the optimal location and size of the due window to minimize the total earliness, tardiness, and due-window-related costs. We propose polynomial time algorithms for all the cases of the problem under study. | |||
Property / review text: Summary: This paper discusses due-window assignment and scheduling with multiple rate-modifying activities. Multiple types of rate-modifying activities are allowed to perform on a single machine. The learning effect and job deterioration are also integrated concurrently into the problem which makes the problem more realistic. The objective is to find jointly the optimal location to perform multiple rate-modifying activities, the optimal job sequence, and the optimal location and size of the due window to minimize the total earliness, tardiness, and due-window-related costs. We propose polynomial time algorithms for all the cases of the problem under study. / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90B22 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 5904879 / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q58692707 / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2005932085 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Single-machine scheduling with learning considerations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Single machine scheduling with learning effect considerations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Scheduling with general job-dependent learning curves. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Single-machine and two-machine flowshop scheduling with general learning functions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Single-machine group scheduling with a time-dependent learning effect / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Machine scheduling with a rate-modifying activity / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Two-parallel machines scheduling with rate-modifying activities to minimize total completion time / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A note on the optimal sequence position for a rate-modifying activity under simple linear deterioration / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Scheduling with job-dependent learning effects and multiple rate-modifying activities / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Minimizing the total completion time in single-machine scheduling with aging/deteriorating effects and deteriorating maintenance activities / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Scheduling Deteriorating Jobs on a Single Processor / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Scheduling jobs under simple linear deterioration / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Scheduling start time dependent jobs to minimize the total weighted completion time / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Complexity analysis of job-shop scheduling with deteriorating jobs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A note on flow shop scheduling problems with deteriorating jobs on no-idle dominant machines / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Scheduling deteriorating jobs subject to job or machine availability constraints / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Parallel-machine scheduling with simple linear deterioration to minimize total completion time / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: SCHEDULING PROBLEMS WITH THE EFFECTS OF DETERIORATION AND LEARNING / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A survey of the state-of-the-art of common due date assignment and scheduling research / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Common due date scheduling with autonomous and induced learning / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Common due window size and location determination in a single machine scheduling problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Scheduling a maintenance activity and due-window assignment on a single machine / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Single-machine due-window assignment and scheduling with job-dependent aging effects and deteriorating maintenance / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A note to due-window assignment and single machine scheduling with deteriorating jobs and a rate-modifying activity / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Λ-Shaped Policies to Schedule Deteriorating Jobs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4739657 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2734595 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 03:57, 4 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Due-window assignment and scheduling with multiple rate-modifying activities under the effects of deterioration and learning |
scientific article |
Statements
Due-window assignment and scheduling with multiple rate-modifying activities under the effects of deterioration and learning (English)
0 references
7 June 2011
0 references
Summary: This paper discusses due-window assignment and scheduling with multiple rate-modifying activities. Multiple types of rate-modifying activities are allowed to perform on a single machine. The learning effect and job deterioration are also integrated concurrently into the problem which makes the problem more realistic. The objective is to find jointly the optimal location to perform multiple rate-modifying activities, the optimal job sequence, and the optimal location and size of the due window to minimize the total earliness, tardiness, and due-window-related costs. We propose polynomial time algorithms for all the cases of the problem under study.
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references