On-line scheduling of job that enters production system at any time was researched in this paper. Those jobs that have been previously scheduled can't be rescheduled again. Time required to perform the operations was intervalvalued and available time length of machines and operators was interval-valued too. The goal was to take best advantage of the available resources to minimize the completion time for the new job entering the production system. A real time algorithm that guaranteed an optimal completion time was proposed. One example was provided to illustrate this approach.
展开▼
