Minimizing mean weighted execution time loss on identical and uniform processors
Information Processing Letters
Minimizing the number of tardy job units under release time constraints
Discrete Applied Mathematics - Combinatorial Optimization
Single machine scheduling to minimize total late work
Operations Research
A branch and bound algorithm for the job-shop scheduling problem
Discrete Applied Mathematics - Special volume: viewpoints on optimization
Mathematics of Operations Research
Minimizing the weighted number of tardy task units
Discrete Applied Mathematics
Scheduling Computer and Manufacturing Processes
Scheduling Computer and Manufacturing Processes
Computers and Industrial Engineering
Open shop scheduling problems with late work criteria
Discrete Applied Mathematics
Handbook of Scheduling: Algorithms, Models, and Performance Analysis
Handbook of Scheduling: Algorithms, Models, and Performance Analysis
A comparison of solution procedures for two-machine flow shop scheduling with late work criterion
Computers and Industrial Engineering
A note on the two machine job shop with the weighted late work criterion
Journal of Scheduling
Metaheuristics for late work minimization in two-machine flow shop with common due date
KI'05 Proceedings of the 28th annual German conference on Advances in Artificial Intelligence
Approximation algorithms for scheduling a single machine to minimize total late work
Operations Research Letters
Late work minimization in flow shops by a genetic algorithm
Computers and Industrial Engineering
Robotic material handler scheduling in flexible manufacturing systems for mass customization
Robotics and Computer-Integrated Manufacturing
| Hi-index | 0.01 |
The paper concerns a small flexible manufacturing system consisting of three CNC machines: a lathe machine, milling machine and measurement center and a single robot, located at the Poznan University of Technology. A short description of the production environment, which can be modeled as the extended job shop system with open shop sections within particular jobs, is followed by the proposition of a branch and bound method. It optimizes production plans within a single shift in order to minimize the late work, i.e. the amount of work executed after a given due date. Based on results of computational experiments, conclusions are formulated on the efficiency of the B&B algorithm and on the behavior of FMS under consideration.