Robust min–max regret scheduling to minimize the weighted number of late jobs with interval processing times
Sign Up to like & getrecommendations! Published in 2020 at "Annals of Operations Research"
DOI: 10.1007/s10479-019-03263-6
Abstract: We consider the robust version of single machine scheduling problem with the objective to minimize the weighted number of jobs completed after their due-dates. The jobs have uncertain processing times represented by intervals, and decision-maker… read more here.
Keywords: weighted number; robust min; minimize weighted; processing times ... See more keywords
Study on flow shop scheduling with sum-of-logarithm-processing-times-based learning effects
Sign Up to like & getrecommendations! Published in 2019 at "Journal of Applied Mathematics and Computing"
DOI: 10.1007/s12190-019-01255-0
Abstract: This paper addresses flow shop scheduling problems with sum-of-logarithm-processing-times-based learning effects. The objective is to minimize the total completion time, the makespan, the total weighted completion time, and the sum of the quadratic job completion… read more here.
Keywords: shop scheduling; logarithm processing; processing times; flow shop ... See more keywords
An intelligent water drop algorithm to identical parallel machine scheduling with controllable processing times: a just-in-time approach
Sign Up to like & getrecommendations! Published in 2017 at "Computational and Applied Mathematics"
DOI: 10.1007/s40314-015-0218-3
Abstract: Identical parallel machine scheduling problem with controllable processing times is investigated in this research. In such an area, our focus is mostly motivated by the adoption of just-in-time (JIT) philosophy with the objective of minimizing… read more here.
Keywords: parallel machine; machine; expansion; identical parallel ... See more keywords
Algorithms for minimizing the number of tardy jobs for reducing production cost with uncertain processing times
Sign Up to like & getrecommendations! Published in 2017 at "Applied Mathematical Modelling"
DOI: 10.1016/j.apm.2017.01.039
Abstract: Abstract This paper addresses a manufacturing system consisting of a single machine. The problem is to minimize the number of tardy jobs where processing times are uncertain, which are within some intervals. Minimizing the number… read more here.
Keywords: tardy jobs; processing times; number tardy; minimizing number ... See more keywords
A new improved NEH heuristic for permutation flowshop scheduling problems
Sign Up to like & getrecommendations! Published in 2017 at "International Journal of Production Economics"
DOI: 10.1016/j.ijpe.2017.06.026
Abstract: Abstract Job evaluation and differentiation are crucial in scheduling. Since jobs can be represented by vectors of processing times, the average, standard deviation, and skewness of job processing times can be defined as the moments… read more here.
Keywords: improved neh; permutation; scheduling problems; new improved ... See more keywords
Single machine scheduling with controllable processing times and an unavailability period to minimize the makespan
Sign Up to like & getrecommendations! 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
A Neutrosophic Number-Based Memetic Algorithm for the Integrated Process Planning and Scheduling Problem With Uncertain Processing Times
Sign Up to like & getrecommendations! Published in 2020 at "IEEE Access"
DOI: 10.1109/access.2020.2996496
Abstract: Process planning and scheduling are two crucial components in a flexible manufacturing system. Lots of novel meta-heuristics have been applied to the integrated process planning and scheduling (IPPS) problem for an efficient utilization of manufacturing… read more here.
Keywords: planning scheduling; problem; uncertain processing; processing times ... See more keywords
A Single-Machine Scheduling Problem with Uncertainty in Processing Times and Outsourcing Costs
Sign Up to like & getrecommendations! Published in 2017 at "Mathematical Problems in Engineering"
DOI: 10.1155/2017/5791796
Abstract: We consider a single-machine scheduling problem with an outsourcing option in an environment where the processing time and outsourcing cost are uncertain. The performance measure is the total cost of processing some jobs in-house and… read more here.
Keywords: processing; scheduling problem; machine scheduling; single machine ... See more keywords
An Efficient Multiobjective Backtracking Search Algorithm for Single Machine Scheduling with Controllable Processing Times
Sign Up to like & getrecommendations! Published in 2017 at "Mathematical Problems in Engineering"
DOI: 10.1155/2017/8696985
Abstract: The scheduling problem with controllable processing times (CPT) is one of the most important research topics in the scheduling field due to its widespread application. Because of the complexity of this problem, a majority of… read more here.
Keywords: search; controllable processing; machine scheduling; single machine ... See more keywords
High-Temperature Short-Time Preserves Human Milk's Bioactive Proteins and Their Function Better Than Pasteurization Techniques With Long Processing Times
Sign Up to like & getrecommendations! Published in 2022 at "Frontiers in Pediatrics"
DOI: 10.3389/fped.2021.798609
Abstract: Donor human milk is generally processed by holder pasteurization (HoP) at 62. 5°C for 30 min. This temperature-time combination is sufficient for eliminating pathogens in donor milk, but also negatively affects several bioactive milk components.… read more here.
Keywords: time; human milk; pasteurization; temperature ... See more keywords
A unified analysis for scheduling problems with variable processing times
Sign Up to like & getrecommendations! Published in 2021 at "Journal of Industrial and Management Optimization"
DOI: 10.3934/jimo.2021008
Abstract: This paper considers single-machine scheduling problems with variable processing times, in which the actual processing time of a job is a function of its additional resources, starting time, and position in a sequence. Four problems… read more here.
Keywords: variable processing; analysis scheduling; problems variable; processing times ... See more keywords