A zero-one (0-1) linear programming formulation of multiproject and job-shop scheduling problems is presented that is more general and computationally tractable than other known formulations. It can accomodate a wide range of iwal-world situations including multiple resource c'.nstraints, due dates, job splitting, resource substitutabiilty, and concurrency and nonconcurrency of job performance requirements. Three possible objective functions are discussed: minimizing total throughput time for all projects: minimizing the time by which all projects are completed (i.e., minimizing makespan); and minimizing total lateness or lateness penalty for all projects. however, another look at the problem from a mathematical programming point of view seems in order, especially in light of recent developments in 0-I programming [7,9,18,25]. INTRODUCTIONThe -;chcduling problens cunsidered here deal with det,,idnng when a job should be processed, given limited e'.ailabilitius of rcources, e.g., rmen, equiptwnL, and facilities. The words .ob adI project will be used Lhvuugliout to denote the two levels of work aggregation being considered. A project consOi.tr of a set of jobs.In Luthei literaturc describing acht-d4ling research, the following equivalent descriptors way be found: Equations are developed to ensure that a schedule meets the foliowing constraints when they are imposed: