File: timeblocks_sameday.c

package info (click to toggle)
tablix2 0.3.3-1
  • links: PTS
  • area: main
  • in suites: etch, etch-m68k
  • size: 9,816 kB
  • ctags: 2,970
  • sloc: ansic: 21,647; xml: 12,230; sh: 9,879; makefile: 762; perl: 564; yacc: 288
file content (251 lines) | stat: -rw-r--r-- 6,532 bytes parent folder | download | duplicates (5)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
/* TABLIX, PGA general timetable solver                                    */
/* Copyright (C) 2002-2005 Tomaz Solc                                      */

/* This program is free software; you can redistribute it and/or modify    */
/* it under the terms of the GNU General Public License as published by    */
/* the Free Software Foundation; either version 2 of the License, or       */
/* (at your option) any later version.                                     */

/* This program is distributed in the hope that it will be useful,         */
/* but WITHOUT ANY WARRANTY; without even the implied warranty of          */
/* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the           */
/* GNU General Public License for more details.                            */

/* You should have received a copy of the GNU General Public License       */
/* along with this program; if not, write to the Free Software             */
/* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA */

/* $Id: timeblocks_sameday.c,v 1.2 2006-01-07 16:49:06 avian Exp $ */

/** @module
 *
 * @author Antonio Duran
 * @author-email antonio.duran.terres@gmail.com
 *
 * @credits
 * Additional error checking by Tomaz Solc
 *
 * @brief 
 * Adds a weight if two timeblocks are scheduled on the same day. 
 *
 * This module divides repetitions of an event into groups of equal sizes. It
 * then makes sure that two such groups aren't scheduled on the same day.
 *
 * This module is deprecated. sameday.so module in combination with 
 * consecutive.so provides the same functionality with better performance.
 *
 * @ingroup School scheduling
 */

/** @tuple-restriction periods-per-block
 *
 * <restriction type="periods-per-block">periods</restriction>
 *
 * Set this restriction to schedule blocks of events on different days.
 *
 * For example:
 *
 * <event name="test" repeats="6">
 *	<resource type="teacher" name="a"/>
 *	<resource type="class" name="2"/>
 *	<restriction type="periods-per-block">2</restriction>
 * </event>
 *
 * This restriction tells Tablix to schedule 2 events "test" on one day, 
 * next 2 events "test" on some other day and next 2 events "test" again
 * on a different day.
 *
 */


#ifdef HAVE_CONFIG_H
#include "config.h"
#endif

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

#include "module.h"

struct cons_t {
        int *tuples;
        int tuplenum;
        int ppb;        /* Periods per block */
};

static struct cons_t *con=NULL;
static int connum=0;

static int periods, days;

static int events_equal(int tupleid1, int tupleid2) 
{
        int equal;
        int n;

        equal=0;
        if(!strcmp(dat_tuplemap[tupleid1].name, dat_tuplemap[tupleid2].name)) {
                /* Names of the tuples are equal */
                /* Check if they are using the same constant resources */
                equal=1;
                for(n=0;n<dat_typenum;n++) if(!dat_restype[n].var) {
                        if(dat_tuplemap[tupleid1].resid[n]!=
                                        dat_tuplemap[tupleid2].resid[n]) {
                                equal=0;
                                break;
                        }
                }
        }
        return equal;
}

static int known_event(int tupleid)
{
        int n,m;

        for(n=0;n<connum;n++) {
                for(m=0;m<con[n].tuplenum;m++) {
                        if(con[n].tuples[m]==tupleid) return n;
                }
        }

        return -1;
}

int getevent(char *restriction, char *cont, tupleinfo *tuple)
{
        int tupleid1, tupleid2;
        int n;
        int c,d;

        if(strlen(cont)<=0) {
                error(_("restriction 'periods-per-block' takes an argument"));
                return(-1);
        }

        c = sscanf(cont, "%d ", &d);
        if(d <= 0 || d > periods) {
                error(_("Invalid number of periods"));
                return(-1);
        }

        tupleid1=tuple->tupleid;
        tupleid2=tuple->tupleid-1;

        n=known_event(tupleid2);

        if(tupleid1>0&&events_equal(tupleid1, tupleid2)&&n>-1) {
                con[n].tuples[con[n].tuplenum]=tupleid1;
                con[n].tuplenum++;
        } else {
                con=realloc(con, sizeof(*con)*(connum+1));
                con[connum].tuples=malloc(
                                sizeof(*(con[connum].tuples))*dat_tuplenum);
                con[connum].tuples[0]=tupleid1;
                con[connum].tuplenum=1;
                con[connum].ppb=d;
                connum++;
        }
        return 0;
}


int module_fitness(chromo **c, ext **e, slist **s)
{
	int sum;
	int i,j,k;
	int day1, day2;
	int times_today;

	chromo *time=c[0];

	sum=0;
	for(i=0;i<connum;i++) {
		for(j=0;j<con[i].tuplenum;j++) {
			day1=time->gen[con[i].tuples[j]]/periods;
			times_today = 1;
			for(k=0;k<con[i].tuplenum;k++) {
				if (j == k)
					continue;

				day2=time->gen[con[i].tuples[k]]/periods;

				if (day1==day2) 
				{
					times_today++;
				}
			}
			if(times_today!=con[i].ppb) sum++;
		}

	}

	return(sum);
}

int module_precalc(moduleoption *opt) 
{
	int c;
	if(connum<1) {
		info(_("module '%s' has been loaded, but not used"), 
							"timeblocks.so");
	}

	for(c=0;c<connum;c++) {
		if(con[c].tuplenum<2) {
			info(_("Useless 'periods-per-block' restriction for "
			       "only one event '%s'"), 
					dat_tuplemap[con[c].tuples[0]].name);
		}
	}

	for(c=0;c<connum;c++) {
		if(con[c].tuplenum%con[c].ppb!=0) {
			error(_("Event '%s' has invalid 'periods-per-block' "
				"restriction"), 
					dat_tuplemap[con[c].tuples[0]].name);
			error(_("Number of periods per block is not divisible "
				"with the number of repetitions of the event"));
			return(-1);
		}
	}

	for(c=0;c<connum;c++) {
		if(con[c].tuplenum/con[c].ppb>days) {
			error(_("Event '%s' has invalid 'periods-per-block' "
				"restriction"), 
					dat_tuplemap[con[c].tuples[0]].name);
			error(_("Number of blocks is greater than number of "
				"days in a week"));
			return(-1);
		}
	}
	return(0);
}


int module_init(moduleoption *opt)
{
	int c;
	fitnessfunc *fitness;

	c=res_get_matrix(restype_find("time"), &days, &periods);
	if(c) {
		error(_("Resource type 'time' is not a matrix"));
		return -1;
	}

	precalc_new(module_precalc);

	handler_tup_new("periods-per-block", getevent);

	fitness=fitness_new("timeblocks_sameday",
			option_int(opt, "weight"),
			option_int(opt, "mandatory"),
			module_fitness);

	if(fitness_request_chromo(fitness, "time")) return -1;

	return 0;
}