Sign Up to like & get
recommendations!
1
Published in 2021 at "Annals of Operations Research"
DOI: 10.1007/s10479-018-2852-9
Abstract: In this paper we study the classical single machine scheduling problem where the objective is to minimize the weighted number of tardy jobs. Our analysis focuses on the case where one or more of three…
read more here.
Keywords:
tardy jobs;
weighted number;
number;
number tardy ... See more keywords
Sign Up to like & get
recommendations!
0
Published in 2020 at "Optimization Letters"
DOI: 10.1007/s11590-019-01389-x
Abstract: This paper studies the bounded parallel-batching scheduling problem considering job rejection, deteriorating jobs, setup time, and non-identical job sizes. Each job will be either rejected with a certain penalty cost, or accepted and further processed…
read more here.
Keywords:
batching scheduling;
non identical;
job;
deteriorating jobs ... See more keywords
Photo from wikipedia
Sign Up to like & get
recommendations!
1
Published in 2021 at "Operational Research"
DOI: 10.1007/s12351-021-00627-4
Abstract: We study a single machine scheduling problem, where the goal is to maximize the weighted number of jobs completed exactly at their due-dates. The option of job-rejection is considered, i.e., the scheduler may perform only…
read more here.
Keywords:
maximize weighted;
job rejection;
weighted number;
single machine ... See more keywords
Sign Up to like & get
recommendations!
0
Published in 2017 at "Applied Mathematical Modelling"
DOI: 10.1016/j.apm.2017.07.028
Abstract: Abstract In this paper, we study a single machine scheduling problem by simultaneously considering the processing method of serial-batching, learning effect, resource-dependent processing times, and setup operations. We consider minimizing the makespan as the objective…
read more here.
Keywords:
effect resource;
resource;
serial batching;
machine scheduling ... See more keywords
Photo from wikipedia
Sign Up to like & get
recommendations!
1
Published in 2019 at "IFAC-PapersOnLine"
DOI: 10.1016/j.ifacol.2019.11.320
Abstract: Abstract In manufacturing of integrated circuits, burn in operations are key operations to improve the quality by detecting early failures. Such operations are performed in the so-called batch ovens, able to process several circuits at…
read more here.
Keywords:
machine;
total completion;
single machine;
time ... See more keywords
Sign Up to like & get
recommendations!
0
Published in 2018 at "International Journal of Production Economics"
DOI: 10.1016/j.ijpe.2017.12.025
Abstract: We study a single machine scheduling problem, where job processing times are controllable, and there is a fixed machine unavailability interval. We assume that the job processing time is a convex decreasing function of the…
read more here.
Keywords:
machine;
processing;
machine scheduling;
scheduling controllable ... See more keywords
Photo from wikipedia
Sign Up to like & get
recommendations!
0
Published in 2019 at "Procedia Manufacturing"
DOI: 10.1016/j.promfg.2020.01.358
Abstract: Abstract This article addresses the single machine scheduling problem in which the actual processing time of jobs change depending on an elapsed time between its start time and a released time or completion time of…
read more here.
Keywords:
maintenance activities;
problem;
time;
single machine ... See more keywords
Photo from academic.microsoft.com
Sign Up to like & get
recommendations!
1
Published in 2017 at "Journal of the Operational Research Society"
DOI: 10.1057/s41274-017-0238-z
Abstract: This paper describes a single-machine scheduling problem of maximizing total job value with a machine availability constraint. The value of each job decreases over time in a stepwise fashion. Several solution properties of the problem…
read more here.
Keywords:
machine;
total job;
maximizing total;
value ... See more keywords
Photo from wikipedia
Sign Up to like & get
recommendations!
0
Published in 2017 at "International Journal of Production Research"
DOI: 10.1080/00207543.2016.1224949
Abstract: This study addresses the single-machine scheduling problem with a common due window (CDW) that has a constant size and position. The objective is to minimise the total weighted earliness–tardiness penalties for jobs completed out of…
read more here.
Keywords:
due window;
common due;
dynamic dispatching;
constructive heuristic ... See more keywords
Photo from wikipedia
Sign Up to like & get
recommendations!
0
Published in 2019 at "International Journal of Production Research"
DOI: 10.1080/00207543.2019.1566675
Abstract: In this paper, the single-machine scheduling problems with deteriorating effects and a machine maintenance are studied. In this circumstance, the deterioration rates of the jobs during the machining process are the same which reduces the…
read more here.
Keywords:
machine;
maintenance;
time;
machine scheduling ... See more keywords
Photo from wikipedia
Sign Up to like & get
recommendations!
0
Published in 2021 at "International Journal of Production Research"
DOI: 10.1080/00207543.2021.1910746
Abstract: In modern production systems, considering machine conditions is becoming essential to achieving an overall optimisation of the production schedule. This paper studies a single machine scheduling pr...
read more here.
Keywords:
machine;
dynamic optimisation;
machine conditions;
machine scheduling ... See more keywords