[PDF] Top 20 Minimizing total weighted tardiness for the single machine scheduling problem with dependent setup time and precedence constraints

... tackles the single machine scheduling problem with dependent setup time and precedence ...constraints. The primary objective of ... See full document

... In the meantime, single machine scheduling problem is one of the most scheduling problems due to its practical ...importance. The significance of the ... See full document

... the problem was developed by Tan and Narasimhan (1997) ...between the BB, GA, SA, and random-start adjacent pairwise interchange ...that the local improvement method offers ... See full document

... assignment and weighted number of tardy jobs, in which the actual processing time of a job is a linear increasing function of its starting ...study the problem of ... See full document

... Logendran and Subur [2004] studied the UPMSP, with job splitting and distinct release dates for jobs and machines, to minimize total weighted ...tardiness. ... See full document

... on the same benchmark ...shop scheduling with machines which are not continuously available due to preventive maintenance ...between the machines in the design of loop layout. ... See full document

... Abstract: The permutation flow shop scheduling problem has been completely concentrated on in late decades, both from single objective and additionally from multi-objective points of ... See full document

... (GAs) and Tabu Search (TS) have been proposed to find the near optimal solutions for the problem of scheduling jobs on a single ma- chine with a common due date [6, 7, 9] ... See full document

... total weighted completion time of jobs and proposed seven DRs based ...instances, and provided good solutions. Also in parallel machine environments, Na et ...dealt with a ... See full document

... Yalaoui and Chu (2003) and Tahar et ...for the identical parallel machine scheduling problem with job splitting and with sequence dependent ... See full document

... offline scheduling structure, all the details about the jobs are gathered before the process ...that the offline version of single machine batching problem is ... See full document

... services. The problem considered in this paper concerns scheduling of maintenance tasks under resource (maintenance teams) ...This problem is generally known as unrelated parallel ... See full document

... for minimizing � ��� (Patterson et al., 1989; Talbot, 1982). But, during the last 2 decades, scientists have developed more RCPSP problems considering varied ...RCPSP with four optimization criteria: ... See full document

... that the payment are made to the suppliers immediately after receiving the ...of time for settling the account on a day-to-day basis (Aggarwal and Jaggi ...consider the ... See full document

... Hejazi and Saghafian (2005) made a comprehensive literature review concerning the flow shop production ...environment. The authors showed that most of the research done in this area considers ... See full document

... models and techniques. This phase of the planning process comprises vehicle scheduling, crew scheduling and rostering ...describe the integrated vehicle-crew-rostering ... See full document

... Este trabalho ´e motivado pelo impacto econˆomico de problemas de sequenciamento na cadeia de suprimento e pela sua aplicabilidade em ambientes industriais e de servi¸cos. Este estudo trata do sequenciamento de tarefas ... See full document

... of the sample during heat treatment and heat treatment of the characteristic parameters of the tested bronze samples shown in Figure ...4. The heat treatment process consisted of ... See full document

... Considering the application DAG shown in Fig. 4, Table 1 shows the computation ...matrix. The generated schedule along with stepwise trace of the HCPT algorithm and NDCP ... See full document

... encouraged the implementation of mixed assembly lines in many industrial environments (Mendes et ...in the same assembly line (AL) (Becker & Scholl, 2006), and different sales cycles may be ... See full document