Keyword: job shop

Found 171 papers in total
Integrated application of TRIZ with lean in the manufacturing process in a machine shop for the productivity improvement
Integrated application of TRIZ with lean in the manufacturing process in a machine shop for the productivity improvement
2014,
The reduction of waste is essential in the present scenario and to survive in the...
Polynomial time approximation algorithms for proportionate open-shop scheduling
Polynomial time approximation algorithms for proportionate open-shop scheduling
2014,
This paper deals with the presentation of polynomial time (approximation) algorithms...
On scheduling with the non-idling constraint
On scheduling with the non-idling constraint
2014,
In this paper, we give an overview of the main results obtained on the complexity of...
Single‐machine scheduling with common due‐window assignment for deteriorating jobs
Single‐machine scheduling with common due‐window assignment for deteriorating jobs
2014,
In this paper, we consider a single‐machine common due‐window assignment...
Multi‐coloring and job‐scheduling with assignment and incompatibility costs
Multi‐coloring and job‐scheduling with assignment and incompatibility costs
2013,
Consider a scheduling problem ( P ) which consists of a set of jobs to be performed...
Research on permutation flow shop scheduling problems with general position‐dependent learning effects
Research on permutation flow shop scheduling problems with general position‐dependent learning effects
2013,
Machine learning exists in many realistic scheduling situations. This study focuses on...
A self‐tuning PSO for job‐shop scheduling problems
A self‐tuning PSO for job‐shop scheduling problems
2014,
From previously published literature, there is a well‐behaved PSO variant...
Single machine total tardiness maximization problems: complexity and algorithms
Single machine total tardiness maximization problems: complexity and algorithms
2013,
In this paper, we consider some scheduling problems on a single machine, where...
Pareto optimization of rescheduling with release dates to minimize makespan and total sequence disruption
Pareto optimization of rescheduling with release dates to minimize makespan and total sequence disruption
2013,
We consider the rescheduling on a single machine with release dates to minimize the...
Job‐shop scheduling in a body shop
Job‐shop scheduling in a body shop
2013,
We study a generalized job‐shop problem called the body shop scheduling problem...
Scheduling jobs with mixed processing times, arbitrary precedence constraints and maximum cost criterion
Scheduling jobs with mixed processing times, arbitrary precedence constraints and maximum cost criterion
2013,
We consider single‐machine scheduling problems with variable job processing...
Family sequencing and cooperation
Family sequencing and cooperation
2013,
Explicitly taking into account admissibility restrictions due to the presence of the...
A new heuristic for workload balancing on identical parallel machines and a statistical perspective on the workload balancing criteria
A new heuristic for workload balancing on identical parallel machines and a statistical perspective on the workload balancing criteria
2012,
We consider the multiprocessor scheduling problem in which independent jobs are...
Scheduling deteriorating jobs with CON/SLK due date assignment on a single machine
Scheduling deteriorating jobs with CON/SLK due date assignment on a single machine
2011,
This paper considers the problem of scheduling deteriorating jobs and due date...
On the Approximability of Single‐Machine Scheduling with Precedence Constraints
On the Approximability of Single‐Machine Scheduling with Precedence Constraints
2011,
We consider the single‐machine scheduling problem to minimize the weighted sum...
Matching based very large‐scale neighborhoods for parallel machine scheduling
Matching based very large‐scale neighborhoods for parallel machine scheduling
2011,
In this paper we study very large‐scale neighborhoods for the minimum total...
Optimal algorithms for single‐machine scheduling with rejection to minimize the makespan
Optimal algorithms for single‐machine scheduling with rejection to minimize the makespan
2011,
In this paper we consider the single‐machine scheduling problem with rejection....
Group scheduling and due date assignment on a single machine
Group scheduling and due date assignment on a single machine
2011,
We consider a single‐machine scheduling problem involving both the due date...
An improved monotone algorithm for scheduling related machines with precedence constraints
An improved monotone algorithm for scheduling related machines with precedence constraints
2011,
We answer an open question posed by Krumke et al. (2008) by showing how to turn the...
Developing a mathematical model for cell formation in cellular manufacturing systems
Developing a mathematical model for cell formation in cellular manufacturing systems
2011,
Cellular manufacturing is an application of group technology (GT) concepts....
Scheduling jobs with chain precedence constraints and deteriorating jobs
Scheduling jobs with chain precedence constraints and deteriorating jobs
2011,
In this paper we consider a single machine scheduling problem with deteriorating jobs....
Single machine batch scheduling with two competing agents to minimize total flowtime
Single machine batch scheduling with two competing agents to minimize total flowtime
2011,
We study a single machine scheduling problem, where two agents compete on the use of a...
A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates
A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates
2011,
We study a single‐machine scheduling problem in a flexible framework where both...
Two‐machine flow shop scheduling problem with an outsourcing option
Two‐machine flow shop scheduling problem with an outsourcing option
2011,
We consider a two‐machine flow shop problem in which each job is processed...
Papers per page: