Bidirectional Load Planning Procedure for Job-Shops with Availability Time-Windows for Specific Machines

2015 ◽  
Vol 760 ◽  
pp. 181-186
Author(s):  
Mădălin Gabriel Catană ◽  
Sergiu Tonoiu ◽  
Mihail Purcărea
Keyword(s):  
Time Windows ◽  
Heuristic Procedure ◽  
Job Shops ◽  
Priority Rules ◽  
Load Planning ◽  
Availability Constraints ◽  
Planning Procedure

This paper presents a bidirectional load planning procedure for job-shops with availability time-windows for specific machines. This heuristic procedure uses priority rules and reverse planning directions to progressively construct two schedules: one for machines with availability constraints (the bottlenecks) and upstream, and other for bottlenecks downstream. Bottlenecks schedule is driving the schedule for all other non-bottleneck machines. Makespan reduction for aggregate schedule is finally performed if possible, by left shifting scheduled operations to their earliest start times.

A hybrid heuristic procedure for the Windy Rural Postman Problem with Zigzag Time Windows

2017 ◽  
Vol 88 ◽  
pp. 247-257 ◽  
Author(s):  
Oliver Lum ◽  
Rui Zhang ◽  
Bruce Golden ◽  
Edward Wasil
Keyword(s):  
Time Windows ◽  
Heuristic Procedure ◽  
Hybrid Heuristic ◽  
Rural Postman Problem

scholarly journals Model of Construction Subcontractors Selection with Time Windows for their Availability

2019 ◽  
Vol 65 (4) ◽  
pp. 295-307
Author(s):  
S. Biruk ◽  
P. Jaskowski ◽  
M. Krzemiński
Keyword(s):  
Mathematical Model ◽  
Resource Availability ◽  
Construction Projects ◽  
Programming Model ◽  
Time Windows ◽  
Mixed Integer ◽  
Time Cost ◽  
Trade Off ◽  
Availability Constraints ◽  
The Cost

AbstractMost construction projects involve subcontracting some work packages. A subcontractor is employed on the basis of their bid as well as according to their availability. A viable schedule must account for resource availability constraints. These resources (e.g. crews, subcontractors) engage in many projects, so they become at the disposal for a new project only in certain periods. One of the key tasks of a planner is thus synchronizing the work of resources between concurrent projects. The paper presents a mathematical model of the problem of selecting subcontractors or general contractor’s crews for a time-constrained project that accounts for the availability of contractors, as well as for the cost of subcontracting works. The proposed mixed integer-binary linear programming model enables the user to perform the time/cost trade-off analysis.

Priority Rules for Job Shops with Weighted Tardiness Costs

1987 ◽  
Vol 33 (8) ◽  
pp. 1035-1047 ◽  
Author(s):  
Ari P. J. Vepsalainen ◽  
Thomas E. Morton
Keyword(s):  
Job Shops ◽  
Priority Rules ◽  
Weighted Tardiness

Two-stage heuristic procedure for scheduling job shops

1993 ◽  
Vol 12 (4) ◽  
pp. 315-325 ◽  
Author(s):  
R. Vancheeswaran ◽  
M.A. Townsend
Keyword(s):  
Heuristic Procedure ◽  
Job Shops ◽  
Two Stage

Project Scheduling with Time Windows and Scarce Resources

2002 ◽  
Author(s):  
Klaus Neumann ◽  
Christoph Schwindt ◽  
Jürgen Zimmermann
Keyword(s):  
Project Scheduling ◽  
Time Windows ◽  
Scarce Resources
Sign in / Sign up

Export Citation Format

Share Document