The problem of scheduling jobs to minimize total weighted tardiness in flowshops,
with the possibility of evolving into hybrid flowshops in the future, is investigated in
this paper. As this research is guided by a real problem in industry, the flowshop
considered has considerable flexibility, which stimulated the development of...
In this paper, we consider a flowshop scheduling problem with sequence-dependent setup times and a bicriteria objective to minimize the work-in-process inventory for the producer and to maximize the customers' service level. The use of a bicriteria objective is motivated by the fact that successful companies in today's environment not...
In this research we address a sequence-dependent group scheduling problem on a set of unrelated-parallel machines where the run time of each job differs on different machines. To benefit both producer and customers we attempt to minimize a linear combination of total weighted completion time and total weighted tardiness. Since...