In this study, we introduce a mixed nonlinear integer programming formulation for parallel machine earliness/tardiness (ET) scheduling with simultaneous effects of learning and linear deterioration, sequence-dependent setups, and a common due-date for all jobs. By the effects of learning and linear deterioration, we propose that the processing time of a job is defined by increasing function of its execution start time and position in the sequence. The developed model allows sequence-dependent setups and sequence-dependent early/tardy penalties. The model can easily provide the optimal solution to problems involving about eleven jobs and two machines
AbstractLearning and job deterioration co-exist in many realistic scheduling situations. This paper ...
This paper assesses the effectiveness in scheduling independent jobs with earliness/tardiness costs...
WOS: 000273608300018The phenomenon of the learning effect has been extensively studied in many diffe...
This paper considers a parallel machine earliness/tardiness (ET) scheduling problem with different p...
This paper considers earliness/tardiness (ET) scheduling problem on a parallel machine environment w...
In this paper parallel identical machines scheduling problems with deteriorating jobs and learning e...
WOS: 000263508800016Conventionally, job processing times are assumed to be constant from the first j...
Abstract—This paper considers the use of insertion of idle time in the unrelated parallel machine sc...
Bu çalışma, öğrenme ve bozulma etkileri altında, Geçmiş Sıra Bağımlı Hazırlık Zamanlı (GSBHZ), paral...
WOS: 000245762500010Minimizing of total tardiness is one of the most studied topics on single machin...
In this paper we study the problem of scheduling n deteriorating jobs on m identical parallel machin...
In this paper, we present both nonlinear job deterioration and nonlinear learning which exist simult...
WOS: 000307285400025In the literature, earliness/tardiness (E/T) problem was known as weighted absol...
AbstractWe discuss the problem of scheduling a set of n independent jobs on m parallel machines to m...
WOS: 000263597700004Conventionally, job processing times are assumed to be constant from the first j...
AbstractLearning and job deterioration co-exist in many realistic scheduling situations. This paper ...
This paper assesses the effectiveness in scheduling independent jobs with earliness/tardiness costs...
WOS: 000273608300018The phenomenon of the learning effect has been extensively studied in many diffe...
This paper considers a parallel machine earliness/tardiness (ET) scheduling problem with different p...
This paper considers earliness/tardiness (ET) scheduling problem on a parallel machine environment w...
In this paper parallel identical machines scheduling problems with deteriorating jobs and learning e...
WOS: 000263508800016Conventionally, job processing times are assumed to be constant from the first j...
Abstract—This paper considers the use of insertion of idle time in the unrelated parallel machine sc...
Bu çalışma, öğrenme ve bozulma etkileri altında, Geçmiş Sıra Bağımlı Hazırlık Zamanlı (GSBHZ), paral...
WOS: 000245762500010Minimizing of total tardiness is one of the most studied topics on single machin...
In this paper we study the problem of scheduling n deteriorating jobs on m identical parallel machin...
In this paper, we present both nonlinear job deterioration and nonlinear learning which exist simult...
WOS: 000307285400025In the literature, earliness/tardiness (E/T) problem was known as weighted absol...
AbstractWe discuss the problem of scheduling a set of n independent jobs on m parallel machines to m...
WOS: 000263597700004Conventionally, job processing times are assumed to be constant from the first j...
AbstractLearning and job deterioration co-exist in many realistic scheduling situations. This paper ...
This paper assesses the effectiveness in scheduling independent jobs with earliness/tardiness costs...
WOS: 000273608300018The phenomenon of the learning effect has been extensively studied in many diffe...