[PDF] Top 20 A Note on Deteriorating Jobs and Learning in Single-Machine Scheduling Problems
Has 10000 "A Note on Deteriorating Jobs and Learning in Single-Machine Scheduling Problems" found on our website. Below are the top 20 most common "A Note on Deteriorating Jobs and Learning in Single-Machine Scheduling Problems".
A Note on Deteriorating Jobs and Learning in Single-Machine Scheduling Problems
... In a separate vein of literature, it has been noticed that jobs may deteriorate as they wait to be ...Kunnathur and Gupta (1990) and Mosheiov (1995) presented several real-life ... See full document
7
Single-Machine Scheduling with Learning Effects and Maintenance: A Methodological Note on Some Polynomial-Time Solvable Cases
... four single-machine scheduling problems (SMSPs) with learning effects and variable maintenance ...the jobs are simultaneously determined by a decreasing function of ... See full document
7
Minimizing weighted earliness and tardiness penalties in single-machine scheduling with idle time permitted
... penalty problems, Ow and Morton [7] described a family of heuristic dispatch rules, but in doing so they considered only schedules without inserted idle ...adjacent jobs to obtain ... See full document
21
Total completion time minimization in two-machine flow shop scheduling problems with a fixed job sequence
... treat a subschedule in which no machine-1 idle time exists between any two consecutive jobs as a ...either a single block consisting of all jobs { 1 , ...or ... See full document
11
A single-machine bi-criterion scheduling problem with two agents
... r a c t The multiple-agent scheduling problems have received increasing attention ...focuses on studying the computational complexity of the intrac- table cases or examining problems ... See full document
11
Single-Machine Scheduling to Minimize Total Completion Time and Tardiness with Two Competing Agents
... time and the total tardiness of the solution generated by SA and 𝑉 ∗ is the value of the optimal solution obtained from the branch-and-bound ...within a second. For each condition, 100 ... See full document
10
D Minimizing Total Earliness and Tardiness for Common Due Date Single-Machine Scheduling with an Unavailability Interval
... of scheduling 𝑛 independent jobs on a single machine with a fixed unavailability interval, where the aim is to minimize the total earliness and tardiness (TET) ... See full document
13
Makespan minimization for m-machine permutation flowshop scheduling problem with learning considerations
... all jobs are generated from a discrete uniform distribu- tion over 1 to ...job-sized problems In order to test the efficiency of the proposed corollary and the lower bound, a ... See full document
13
Scheduling time-dependent jobs under mixed deterioration
... r a c t We consider a new model of time-dependent ...scheduling. A set of deteriorating jobs has to be processed on a single machine which is ... See full document
10
Customer order scheduling to minimize the number of late jobs
... find in polyno- mial time a solution with an objective value at most t if and only if Equal-Size-Partition has a ...case In this section, we develop a lower bound and ... See full document
5
Bi-criteria minimization for the permutation flowshop scheduling problem with machine-based learning effects
... performing jobs with a longer processing time. They brought in a sum-of-job-processing-time-based learning effect scheduling model and showed that the makespan and ... See full document
11
Coupled-task scheduling on a single machine subject to a fixed-job-sequence
... r a c t This paper investigates single-machine coupled-task scheduling where each job has two tasks separated by an exact ...to a given job ...construct a feasible schedule ... See full document
9
A note on "Reducing the number of binary variables in cutting stock problems"
... stock problems (2DCSPs) in real- world applications, such as cutting steel tubes, paper tubes, carpet, and ...orders and reduce the total amount of scrap for each stock in a ... See full document
11
Bicriteria scheduling in a two-machine permutation flowshop
... bounds and the new scheme, we circumvent this problem and use computational experiments to investigate the efficiency ...codes in C language and performed the experiments under the Linux Red ... See full document
16
A Case Study on Machine Learning for Customer Relationship Management in Service Industry
... that in August 2016, the team found that one of the inputted variables could explain the vast majority of the buying behavior of product ...points a customer has, the more likely that he or she will buy the ... See full document
6
Scheduling for fabrication and assembly in a two-machine flowshop with a fixed job sequence
... nents: a common component and a unique component which are fabricated on machine 1 and then assembled on machine ...processed in batches preceded by a ... See full document
17
In my undergraduate and master's research I focused on machine learning and optimization projects
... was a child, I was fascinated by the detectives in novels and movies: intelligently finding important clues, recovering the truth, and at the same time help people in ...only in ... See full document
3
Multi-server machine repair problems under a (V,R) synchronous single vacation policy
... provided in this paper works efficiently for a machine repair model with standbys under a synchronous single vacation ...obtained in terms of matrix forms using the technique of ... See full document
10
A note on breaking and repairing a secure broadcasting in large networks
... In this note, we show that a proposed secure broadcasting scheme is insecure. We also present a modified scheme to overcome this weakness. The modified scheme has the extra advantage that each ... See full document
2
Two-machine flowshop batching and scheduling
... consider in this paper a two-machine flowshop scheduling problem in which the first machine processes jobs individually while the second machine processes ... See full document
13
相關主題