Abstract. The problem of scheduling multiprocessor tasks in a multi-machine environment is considered. Each machine contains a number of identical processors. Each task requires a number of processors on a single machine for its processing. The objective is to minimize the overall task completion time, i.e. the makespan. The general problem has been known to be strongly NP-hard. A linear time optimal algorithm is presented for a special case of the problem where all the tasks have unit processing times and each task requires one or k (k is part of the input) processors. The small computational effort of the algorithm is valuable in some practical applications.
Abstract. The problem of scheduling jobs with sizes on batch machines is considered. Each machine can process several jobs as a batch simultaneously as long as the total size of these jobs does not exceed the capacity of the machine. The processing time of a batch is defined to be the longest processing time of the jobs in the batch. The goal is to minimize makespan, i.e., the maximum job completion time. It has been known to be strongly NP-hard. A linear time exact algorithm is presented for a special case where all the jobs have processing times 1 and sizes 1 or k (k is not fixed).
Abstract-With characteristics of the course "Stamping Process and Die Design" and problems existing in teaching using traditional method, reform measures taken by some colleges are discussed in this paper, including teaching content, teaching material, teaching mode, teaching method, teaching resources and information-based teaching. As indicated in the research, the method of project-oriented teaching is the tendency of teaching reform, and the most effective teaching mode.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.